题意:给一个长度为n的序列,A、B两人玩游戏,可以从左端或者从右端开始取走任意数量的数,最终取得数之和为该人得到的分数,两人都希望自己的分数尽可能高,求最终A - B的分数
思路:区间dp,设dp(i,j)为在区间[i,j]取数时,先手可以得到的最大的分数,则dp[i][j] = sum[i][j] - min(dp[i+1][j],dp[i+2][j]......dp[j][j],dp[i]][i],dp[i][i+1]..dp[i][j-1],0]),有0是因为可以一次性全部取走
#include<cstdio>
#include<cstring>
#include<algorithm>
const int INF = 1e9;
const int maxn = 1e2 + 10;
using namespace std;
int dp[maxn][maxn];
int sum[maxn][maxn];
int n, a[maxn];
int dfs(int x, int y) {
int &ans = dp[x][y];
if(ans != -INF) return ans;
int ns = 0;
for(int i = x; i < y; i++) ns = min(ns, dfs(x, i));
for(int i = x + 1; i <= y; i++) ns = min(ns, dfs(i, y));
ans = sum[x][y] - ns;
return ans;
}
int main() {
while(scanf("%d", &n) && n) {
for(int i = 0; i < maxn; i++) {
for(int j = 0; j < maxn; j++) {
dp[i][j] = -INF;
}
}
memset(sum, 0, sizeof sum);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
for(int i = 0; i < n; i++) {
for(int j = i; j < n; j++) {
if(i == j) dp[i][j] = sum[i][j] = a[i];
else sum[i][j] = sum[i][j - 1] + a[j];
}
}
dfs(0, n - 1);
//printf("sum = %d\n", sum[0][n - 1]);
printf("%d\n", 2 * dp[0][n - 1] - sum[0][n - 1]);
}
return 0;
}