C - Easy Game

区间DP

Description

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

2

 

4

4 -10 -20 7

 

4

1 2 3 4

Sample Output

Case 1: 7

Case 2: 10

给你n个数，A、B两个人从两端取数，每一次可以取连续的一段数，而且每个人都按让自己最优的方案去取数（即取的数的和尽可能大）

问最后A与B的差值最大是多少

解法：枚举区间长度，从小区间DP到大区间 

对于一段区间，枚举分隔点，要么取左边，要么取右边

#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
using namespace std;
int sum[110];
int dp[110][110];
int main()
{
	int r,n,ca=1;
	scanf("%d",&r);
	while(r--)
	{
		scanf("%d",&n);
		sum[0]=0;
	    memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&sum[i]);
			dp[i][i]=sum[i];           //
			sum[i]+=sum[i-1];
		}
		for(int len=1;len<n;len++)
		{
			for(int i=1;i+len<=n;i++)
			{
				dp[i][i+len]=sum[i+len]-sum[i-1];
				for(int j=i;j<i+len;j++)        //j不能到i+len 
				{
					dp[i][i+len]=max(dp[i][i+len],sum[j]-sum[i-1]-dp[j+1][i+len]);
					dp[i][i+len]=max(dp[i][i+len],sum[i+len]-sum[j]-dp[i][j]);       //
				}
			}
		}
		printf("Case %d: %d\n",ca++,dp[1][n]);
	}
}