forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathH.cpp
More file actions
46 lines (36 loc) · 1.33 KB
/
H.cpp
File metadata and controls
46 lines (36 loc) · 1.33 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
const int MN = 1011;
int n, a[MN], f[2][MN][MN];
int get(int turn, int i, int j) {
if (i > j) return 0;
if (f[turn][i][j] >= 0) return f[turn][i][j];
if (turn == 0) {
return f[turn][i][j] = max(get(1, i+1, j) + a[i], get(1, i, j-1) + a[j]);
}
else {
if (a[i] >= a[j]) {
return f[turn][i][j] = get(1-turn, i+1, j) - a[i];
}
else return f[turn][i][j] = get(1-turn, i, j-1) - a[j];
}
}
int main() {
ios :: sync_with_stdio(false);
int test = 0;
while (cin >> n && n) {
FOR(i,1,n) cin >> a[i];
memset(f, -1, sizeof f);
cout << "In game " << ++test << ", the greedy strategy might lose by as many as "
<< get(0, 1, n) << " points.\n";
}
return 0;
}