zoukankan      html  css  js  c++  java
  • 10891

    Problem E
    Game of Sum
    Input File: 
    e.in

    Output: Standard Output

     

    This is a two player game. Initially there are n integer numbers in an array and players A and B get chance to take them alternatively. Each player can take one or more numbers from the left or right end of the array but cannot take from both ends at a time. He can take as many consecutive numbers as he wants during his time. The game ends when all numbers are taken from the array by the players. The point of each player is calculated by the summation of the numbers, which he has taken. Each player tries to achieve more points from other. If both players play optimally and player A starts the game then how much more point can player A get than player B?

    Input

    The input consists of a number of cases. Each case starts with a line specifying the integer n (0 < n ≤100), the number of elements in the array. After that, n numbers are given for the game. Input is terminated by a line where n=0.

    Output

    For each test case, print a number, which represents the maximum difference that the first player obtained after playing this game optimally.

    Sample Input                                Output for Sample Input

    4

    4 -10 -20 7

    4

    1 2 3 4

    0

    7

    10

    #include<iostream>
    #include<cstring>
    using namespace std;
    int a[105],s[105],v[105][105],d[105][105];
    int dp(int i,int j)
    {
    	if(v[i][j]) return d[i][j];
    	v[i][j]=1;
    	int m=0;
    	for(int k=i+1;k<=j;k++)
    		m=min(m,dp(k,j));
    	for(int k=i;k<j;k++)
    		m=min(m,dp(i,k));
    	d[i][j]=s[j]-s[i-1]-m;
    	return d[i][j];
    }
    int main()
    {
    	int n;
    	while(cin>>n&&n)
    	{
    		s[0]=0;
    		memset(v,0,sizeof(v));
    		for(int i=1;i<=n;i++)
    		{
    			cin>>a[i];
    			s[i]=s[i-1]+a[i];
    		}
    		cout<<2*dp(1,n)-s[n]<<endl;
    	}
    	return 0;
    }
  • 相关阅读:
    【读书笔记】MSDN 上关于加密解密的一个例子
    【读书笔记】创建泛型编程类 由链表而深入
    HDFS数据加密空间Encryption zone
    各种数据库的连接方法
    Java基础5
    Java基础4
    Java基础2
    博客优化、收录、RSS技巧
    Java基础3
    Java基础8
  • 原文地址:https://www.cnblogs.com/riskyer/p/3238992.html
Copyright © 2011-2022 走看看