转载请注明出处:http://blog.csdn.net/u012860063?viewmode=contents
题目链接:http://poj.org/problem?id=1163
----------------------------------------------------------------------------------------------------------------------------------------------------------
欢迎光临天资小屋:http://user.qzone.qq.com/593830943/main
----------------------------------------------------------------------------------------------------------------------------------------------------------
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. 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.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Sample Output
30
简单DP例如以下:
#include <iostream> #include <cstring> using namespace std; int n; int dp[117][117]; void DP(int dp[117][117]) { int i, j; for(i = n-1; i >= 0; i--) { for(j = 1; j <= i; j++) { dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]); } } } int main() { int i, j; while(cin >> n) { for(i = 1; i <= n; i++) { for(j = 1; j <= i; j++) { cin>>dp[i][j]; } } DP(dp); cout<<dp[1][1]<<endl; } return 0; }