-
Notifications
You must be signed in to change notification settings - Fork 0
/
loj1004.cpp
62 lines (49 loc) · 1.08 KB
/
loj1004.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
using namespace std;
#include<iostream>
#include<cstdio>
#include<cstring>
#define max(a,b) ((a>b)?(a):(b))
long long int dp[205][105],arr[205][105];
int n;
long long int solve(int i,int j)
{
if(i>=2*n)
return 0;
if(dp[i][j]!=-1)
return dp[i][j];
if(i<n)
{
return dp[i][j]=max(solve(i+1,j)+arr[i][j],solve(i+1,j+1)+arr[i][j]);
}
else
{
if(j==0)
return dp[i][j]=solve(i+1,j)+arr[i][j];
else if(j==(2*n)-i-1)
return dp[i][j]=solve(i+1,j-1)+arr[i][j];
else
return dp[i][j]=max(solve(i+1,j-1)+arr[i][j],solve(i+1,j)+arr[i][j]);
}
}
int main()
{
int T,i,j,Case=1;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(dp,-1,sizeof dp);
for(i=1;i<=n;i++)
{
for(j=0;j<i;j++)
scanf("%lld",&arr[i][j]);
}
for(i=n+1;i<2*n;i++)
{
for(j=0;j<(2*n)-i;j++)
scanf("%lld",&arr[i][j]);
}
printf("Case %d: %lld\n",Case++,solve(1,0));
}
return 0;
}