UVA 10891-Game of Sum(基础DP）

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

                                                                                                                 

A 和B 两个人得到的数的总和是一定的，若保证A 的得分尽可能的大，那么B 就是剩下的数。

最后一个步骤是得到长度为 1~n的最大得分 dp[1][n] ,则答案是 dp[1][n] - (sum - dp[1][n]) = 2* dp[1][n] - sum;

因为 dp[1][n] = sum- min (dp[1][n],dp[2][n] ....dp[1][n-1]...);  dp[i][j] = sum[i][j] - min (dp[i+1][j] , dp[i+2][j] , .....dp[j][j], dp[i][j-1]...dp[i][i], 0);

即子问题是 求得每一个长度的 得分最小值。

CODE：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
typedef long long ll;
const int inf=0xffffff;
using namespace std;

int num[105],s[105];
int  dp[105][105],f[105][105],g[105][105];

int main()
{
    //freopen("in.in","r",stdin);
    int N;
    while(~scanf("%d",&N),N)
    {
        memset(s,0,sizeof(s));
        memset(dp,0,sizeof(dp));
        int sum=0;
        for(int i=1;i<=N;i++)
        {
            scanf("%d",&num[i]);
            s[i] += s[i-1]+num[i];
            sum += num[i];
            dp[i][i] = f[i][i] = g[i][i] = num[i];
        }

        for(int len=1;len<N;len++)
        {
            for(int i=1;i+len<=N;i++)
            {
                int j=len+i;
                int minn = 0;
                minn = min(minn, f[i+1][j]);
                minn = min(minn, g[i][j-1]);
                //minn = min(dp[i+1][j],dp[i][j-1]);
                dp[i][j] = s[j]-s[i-1]-minn;
                f[i][j] = min(dp[i][j],f[i+1][j]);
                g[i][j] = min(dp[i][j],g[i][j-1]);

            }
        }
        printf("%d\n",2*dp[1][N]-sum);
    }
    return 0;
}