UVA10891 Game of Sum DP

训练指南上的题目，简单的dp，使用记忆化搜索

用f(i,j)表示当前取数的人在第i到第j个数字的数列中，按照规则能够得到的最大和是多少、

通过当前取数的人所取得的数字和最大 与 让下一个人所取的数字和最小 这两个关系之间相互转化，进行状态的推导

得到递推的公式

f(i,j)=s[j]-s[i-1]-min(0,f(m,j),f(i,n))

其中 m与n 满足关系       i<m<=j    ,    i<=n<j ，0表示当前取数的人一次把所有数字取走。给剩下的人留下总和为0的方案。  

也就是说min中所处理的数据。是让下一个取数的人，在最好的情况下，所取得的数字和最小。

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

---

Problem setter: Syed Monowar Hossain

Special Thanks: Derek Kisman, Mohammad Sajjad Hossain

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>

using namespace std;

int arrays[110];
int n;
int f[110][110];
int s[110];

int dfs(int l,int r){
   if(l==r) f[l][r]=arrays[l];
   if(f[l][r]!=-1) return f[l][r];
   int ret=0;
   for(int i=l+1;i<=r;i++)
    ret=min(ret,dfs(i,r));
   for(int i=r-1;i>=l;i--)
    ret=min(ret,dfs(l,i));
   f[l][r]=s[r]-s[l-1]-ret;
   return f[l][r];
}

int main(){
    while(~scanf("%d",&n)){
        if(!n) break;
        int ret1=0,ret2=0;
        s[0]=0;
        for(int i=1;i<=n;i++){
            scanf("%d",&arrays[i]);
            s[i]=s[i-1]+arrays[i];
        }
        memset(f,-1,sizeof(f));
        ret1=dfs(1,n);
        ret2=s[n]-ret1;
        printf("%d\n",ret1-ret2);
    }
    return 0;
}