-
Notifications
You must be signed in to change notification settings - Fork 0
/
1031.cpp
95 lines (72 loc) · 1.59 KB
/
1031.cpp
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define PI (acos(-1))
#define ct cout<<
#define cn cin>>
#define spc <<" "<<
#define nl puts("")
#define _fl(x) puts("FLAG " #x);
#define _(x) cout<< #x <<" is "<< x <<endl;
#define fs first
#define sc second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define _109 (1000000000)
#define _0(arr) memset(arr,0,sizeof ( arr ) )
#define _1(arr) memset(arr,-1,sizeof ( arr ) )
#define _ninp(n,arr) for(int i=0; i<n;i++)cin>>arr[i];
#define _nout(n,arr) for(int i=0; i<n;i++)cout<<arr[i]<<" \n"[i==n-1];
double _eps=1e-6;
int dp[110][110][2];
int arr[110];
int f(int i,int j,int a){
if(i>j)return 0;
if(j<i)return 0;
if(dp[i][j][a])return dp[i][j][a];
if(a){
int res=-1000000000;
int sm=0;
for(int l=i;l<=j;l++){
sm+=arr[l];
res=max(res,sm+f(l+1,j,0));
}
sm=0;
for(int l=j;l>=i;l--){
sm+=arr[l];
res=max(res,sm+f(i,l-1,0));
}
return dp[i][j][a]=res;
}
else {
int res=1000000000;
int sm=0;
for(int l=i;l<=j;l++){
sm+=arr[l];
res=min(res,-sm+f(l+1,j,1));
}
sm=0;
for(int l=j;l>=i;l--){
sm+=arr[l];
res=min(res,-sm+f(i,l-1,1));
}
return dp[i][j][a]=res;
}
}
int main() {
int T;
cn T;
for(int caseno=1; caseno<=T ;caseno++){
int n;
cn n;
for (int i = 0; i < n; ++i)
{
/* code */
cn arr[i];
}
_0(dp);
printf("Case %d: %d\n",caseno,f(0,n-1,1));
}
return 0;
}