UVA - 10891 Game of Sum （区间DP）@

Game of Sum

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int dp

, a
, sum
;

int main()
{
int n;
while(scanf("%d",&n),n!=0)
{
memset(dp,0,sizeof(dp));
memset(sum,0,sizeof(sum));
for(int i=1; i<=n; i++)
{
scanf("%d", &a[i]);
dp[i][i]=a[i], sum[i]=sum[i-1]+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];
int m=0;
for(int k=i; k<j; k++)
{
m=min(m,min(dp[i][k],dp[k+1][j]));
}
dp[i][j]=max(dp[i][j],sum[j]-sum[i-1]-m);
}
}
cout<<2*dp[1]
-(sum
-sum[0])<<endl;
}
return 0;
}