light oj 1031 - Easy Game(区间DP->轮流取值的最大差值）

1031 - Easy Game

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

You are playing a two player game. Initially there are n integer numbers in an array and player 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

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer N (1 ≤ N ≤ 100) denoting the size of the array. The next line contains N space separated integers. You may assume that no number will contain more than 4 digits.

Output

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

Sample Input	Output for Sample Input
2   4 4 -10 -20 7   4 1 2 3 4	Case 1: 7 Case 2: 10

题目描述：

　　给出一个数列，两人轮流取数， 取完结束。每次可以取好多个数，但是只能从首或者尾为起点取连续的若干个。问最后两者取数和的绝对值最大为多少？

解题思路：

　　区间dp，处理出来数列的前缀和，dp[l][r] 表示 区间 [l, r] 之间的数取完，两者取数和差值最大的值。枚举区间内点k，假设先手取[l, k] 或者 [k+1, r]取最大值，对剩下部分用先手取到的区间和减去就好，这样对于每一个区间都是先手先取，然后再枚举先手，子区间内的取法就要反一下咯

dp区间表示无论下一个先取值的最优选择；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 110;
int sum[N], a[N], dp[N][N];


int main()
{
    int t, ncase=1, n;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        memset(a,0,sizeof(a));
        memset(sum,0,sizeof(sum));
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            scanf("%d", &a[i]);
            sum[i]=a[i]+sum[i-1];
        }
        for(int i=1;i<=n;i++)
            dp[i][i]=a[i];
        for(int len=1;len<n;len++)
        {
            for(int i=1;i+len<=n;i++)
            {
                int j=i+len;
                dp[i][j]=sum[j]-sum[i-1];
                for(int k=i;k<j;k++)
                {
                    int num = max(sum[k]-sum[i-1]-dp[k+1][j],sum[j]-sum[k]-dp[i][k]);
                    dp[i][j]=max(num,dp[i][j]);
                }
            }
        }
        printf("Case %d: %d\n",ncase++, dp[1][n]);
    }
    return 0;
}