Light oj 1031 Easy Game（记忆化）

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 4digits.

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

 

---

SPECIAL THANKS: JANE ALAM JAN (DATASET)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-8

typedef long long ll;

using namespace std;
#define INF 0x3f3f3f3f
#define N 105

int a[N];
int sum[N];
bool vis[N][N];
int dp[N][N];
int n;

int dfs(int s,int e)
{
    if(vis[s][e]) return dp[s][e];
    vis[s][e]=true;
    if(s>e) return 0;
    dp[s][e]=-INF;
    int all=sum[e]-sum[s-1];

    for(int i=s;i<=e;i++)
    {
        dp[s][e]=max(dp[s][e],all-dfs(i+1,e));
    }

    for(int i=e;i>=s;i--)
        dp[s][e]=max(dp[s][e],all-dfs(s,i-1));
   return dp[s][e];
}

int main()
{
    int i,j,t,ca=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];
        }
        memset(vis,false,sizeof(vis));
        dfs(1,n);
        printf("Case %d: %d\n",++ca,dp[1][n]*2-sum[n]);
    }
    return 0;
}