UVA 10891 Game of Sum

最新推荐文章于 2024-10-01 18:52:56 发布

原创最新推荐文章于 2024-10-01 18:52:56 发布 · 440 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#uva #动态规划

uva 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种两人轮流取数的博弈游戏，并提供了一个详细的动态规划解决方案。通过定义状态转移方程来最大化先手玩家的得分，最终实现计算最优得分差距。

题目

This is a two player game. Initially there are n integer numbers in an array and players 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
The input consists of a number of cases. Each case starts with a line specifying the integer n (0 <
n ≤ 100), the number of elements in the array. After that, n numbers are given for the game. Input is
terminated by a line where n = 0.
Output
For each test case, print a number, which represents the maximum difference that the first player
obtained after playing this game optimally.
Sample Input
4
4 -10 -20 7
4
1 2 3 4
0
Sample Output
7
10

大意

给出n个数，两个人轮流取最左端点任意个数或最右端点任意个数，要求先手取到的数尽可能大。

解法

设dp[0][i][j]表示先手取从i到j这段的最大值，dp[1][i][j]表示后手取从i到j这段的最大值，sum[i]表示前i个数的和，则

dp[0][i][j]=max(dp[0][i][j],dp[1][i][k]+sum[j]-sum[k]);

dp[0][i][j]=max(dp[0][i][j],dp[1][k][j]+sum[k-1]-sum[i-1]);

dp[1][i][j]=sum[j]-sum[i-1]-dp[0][i][j];

答案就是2*dp[0][1][n]-sum[n]。

代码

#include<cstdio>
#define INF 1000000000
int dp[2][105][105],a[105],sum[105];
int max(int a,int b)
{
	return a>b?a:b;
}
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n)&&n)
	{
		sum[0]=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			sum[i]=sum[i-1]+a[i];
		}
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				dp[0][i][j]=-INF;
				dp[1][i][j]=-INF;
			}
		for(i=1;i<=n;i++)
		{
			dp[0][i][i]=a[i];
			dp[1][i][i]=0;
		}
		for(i=2;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				int l=j,r=i+j-1;
				if(r>n)
					break;
				dp[0][l][r]=max(dp[0][l][r],sum[r]-sum[l-1]);
				for(k=l;k<r;k++)
				{
					dp[0][l][r]=max(dp[0][l][r],dp[1][l][k]+sum[r]-sum[k]);
				}
				for(k=l+1;k<=r;k++)
				{
					dp[0][l][r]=max(dp[0][l][r],dp[1][k][r]+sum[k-1]-sum[l-1]);
				}
				dp[1][l][r]=sum[r]-sum[l-1]-dp[0][l][r];
			}
		printf("%d\n",2*dp[0][1][n]-sum[n]);
	}
	return 0;
}