The Triangle | ||||||
| ||||||
Description | ||||||
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
| ||||||
Input | ||||||
Your program is to read from standard input. For each test case, the first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99. Process to the end of file. | ||||||
Output | ||||||
For each test case, your program is to write to standard output. The highest sum is written as an integer. | ||||||
Sample Input | ||||||
5 | ||||||
Sample Output | ||||||
30 |
这个题目是动态规划里面最简单的一类题目了,就是一个很典型数塔问题,我们从数塔的最下方向上方不断进行加法运算就好了,状态转移方程是dp[i-1][j]+=max(dp[i][j],dp[i][j+1]);好了,以下贴上代码:
#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=1005;
int dp[MAXN][MAXN];
int main(){
int n;
while(cin>>n){
int i,j;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
cin>>dp[i][j];
}
}
for(int i=n-1;i>=1;i--){
for(int j=0;j<i;j++){
dp[i-1][j]+=max(dp[i][j],dp[i][j+1]);
}
}
cout<<dp[0][0]<<endl;
}
return 0;
}