标签:
ime Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 45620 | Accepted: 27612 |
Description
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Input
Output
Sample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Sample Output
30
#include<iostream> #include<string.h> #include<stdio.h> using namespace std; const int N=105; int mp[N][N]; int dp[N][N]; int main() { int n; while(~scanf("%d",&n)) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { scanf("%d",&mp[i][j]); } dp[i][i]=dp[i-1][i-1]+mp[i][i]; } for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { if(i==1) dp[i][j]=mp[i][j]; else if(j==1) dp[i][j]=dp[i-1][j]+mp[i][j]; else if(j==i) dp[i][j]=dp[i-1][j-1]+mp[i][j]; else dp[i][j]=max(dp[i-1][j-1]+mp[i][j],dp[i-1][j]+mp[i][j]); } } int ans=0; for(int i=1;i<=n;i++) { if(ans<dp[n][i]) ans=dp[n][i]; } cout<<ans<<endl; } return 0; }
标签:
原文地址:http://www.cnblogs.com/iwantstrong/p/5833644.html