# gems gems gems

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1172    Accepted Submission(s): 242

Problem Description
Now there are n gems, each of which has its own value. Alice and Bob play a game with these n gems.
They place the gems in a row and decide to take turns to take gems from left to right.
Alice goes first and takes 1 or 2 gems from the left. After that, on each turn a player can take k or k+1 gems if the other player takes k gems in the previous turn. The game ends when there are no gems left or the current player can't take k or k+1 gems.
Your task is to determine the difference between the total value of gems Alice took and Bob took. Assume both players play optimally. Alice wants to maximize the difference while Bob wants to minimize it.

Input
The first line contains an integer T (1T10), the number of the test cases.
For each test case:
the first line contains a numbers n (1n20000);
the second line contains n numbers: V1,V2Vn. (100000Vi100000)

Output
For each test case, print a single number in a line: the difference between the total value of gems Alice took and the total value of gems Bob took.

Sample Input
1
3
1 3 2

Sample Output
4

Source

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x, y) memset(x, y, sizeof(x))
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b > a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b < a)a = b; }
const int N = 2e4 + 10, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f;
template <class T1, class T2>inline void gadd(T1 &a, T2 b) { a = (a + b) % Z; }
int casenum, casei;
int n;
int sum[N];
int v[N];
int f[N][202];
int main()
{
scanf("%d", &casenum);
for (casei = 1; casei <= casenum; ++casei)
{
scanf("%d", &n);
for (int i = n; i >= 1; --i)scanf("%d", &v[i]);
for (int i = 1; i <= n; ++i)sum[i] = sum[i - 1] + v[i];

//设m为最大能取到的数量，则有(1+m)*m<=n*2，得到m^2+m<=n*2，得到m<sqrt(n*2)
int m = sqrt(n * 2);
while ((1 + m) * m > n * 2)--m;

for (int i = 1; i <= n; ++i)//枚举当前还剩下几个
{
int top = min(i, m);
for (int j = 1; j <= top; ++j)//枚举上一轮的人拿了多少个
{
f[i][j] = -2e9;
gmax(f[i][j], (sum[i] - sum[i - j]) - f[i - j][j]);							//这一轮拿一样多
if(i > j)gmax(f[i][j], (sum[i] - sum[i - j - 1]) - f[i - j - 1][j + 1]);	//这一轮多拿一个
}
}
printf("%d\n", f[n][1]);
}
return 0;
}
/*
【题意】

【分析】

1，所有非法状态，都以0为初始值即可
2，每个v最多使得绝对值偏差1e5，所以int即可保存所有状态

【时间复杂度&&优化】
O(nsqrt(n))

*/

• 本文已收录于以下专栏：

## HDU 6199 gems gems gems （DP, 2017 ACM/ICPC Asia Regional Shenyang Online）

ProblemNow there are n gems, each of which has its own value. Alice and Bob play a game with these n...

## 【2017沈阳网络赛】1006 hdu6199 gems gems gems 动态规划

Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a...

## HDU 6199 gems gems gems 2017沈阳网络赛 1006

• ssSky_x
• 2017年09月10日 21:34
• 371

## 【2017沈阳网络赛】1006 hdu6199 gems gems gems 动态规划

Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a...

## 51Nod 1277 字符串中的最大值【Dp+set_next】

1277 字符串中的最大值 题目来源： Codility 基准时间限制：1 秒 空间限制：131072 KB 分值: 80 难度：5级算法题 一个字符串的前缀是指包含该字...

举报原因： 您举报文章：【HDU6199 2017 ACM ICPC Asia Regional Shenyang Online F】【博弈 DP】gems gems gems 双人从左侧拿宝石 每次拿相同或加一的最小差值 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)