hdu 2084(数塔-经典dp)

1 #include<iostream>
2 #include<algorithm>
3 const int N=110;
4 using namespace std;
5 int map

,dp

;
6
7 int main(){
8     int _case;
9     scanf("%d",&_case);
10     while(_case--){
11         int n;
12         scanf("%d",&n);
13         memset(map,0,sizeof(map));
14         memset(dp,0,sizeof(dp));
15         for(int i=0;i<n;i++){
16             for(int j=0;j<=i;j++){
17                 scanf("%d",&map[i][j]);
18             }
19         }
20         for(int i=n-1;i>=0;i--){
21             for(int j=0;j<=i;j++){
22                 dp[i][j]=max(dp[i+1][j]+map[i][j],dp[i+1][j+1]+map[i][j]);
23             }
24         }
25         printf("%d\n",dp[0][0]);
26     }
27     return 0;
28 }