The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 45624 | Accepted: 27615 |
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
题意:在给定的数字三角形中寻找一条从顶层到底层的路径,使此路径上的数字加和最大。
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
int r[105][105];
int n;
while(cin>>n)
{
for(int i=1;i<=n;i++)
for(int j=0;j<i;j++)
cin>>r[i][j];
for(int i=n-1;i>=1;i--)
{
for(int j=0;j<i;j++)
{
r[i][j]+=max(r[i+1][j],r[i+1][j+1]);
}
}
cout<<r[1][0]<<endl;
}
}