题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1832
题 意:分别从一个数组的两端任意取值,求各自求出他们的和,并输出左边之和减去右边之和
思 路:使用DFS分别从左边与右边取值。
代码如下:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <climits>
using namespace std;
#define maxn 110
int dp[maxn][maxn], vis[maxn], visit[maxn][maxn], sum[maxn];
int DP( int l, int r )
{
if( visit[l][r] ) return dp[l][r];
visit[l][r] = 1;
int m = 0;
for( int i = l+1; i <= r; i ++ ) m = min( DP(i,r), m );
for( int j = l; j < r; j ++ ) m = min( DP(l,j), m );
dp[l][r] = sum[r] - sum[l-1] - m;
return dp[l][r];
}
int main()
{
int n;
while( scanf ( "%d", &n ) != EOF )
{
if( n == 0 ) break;
sum[0]=0;
memset( visit, 0, sizeof(visit) );
for( int i = 1; i <= n; i ++ )
scanf ( "%d", &vis[i] ),sum[i] = sum[i-1] + vis[i];
printf( "%d\n", 2*DP(1,n)-sum[n] );//DP(左边的取值) - (sum-DP)(右边的取值)
}
return 0;
}