The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 34047 | Accepted: 20245 |
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
讲解:其实就是说从上到下,求最优的的一组解,使得从上到下的和最大。每一行中只取一个,且是上下关联的,数字;
代码如下:
1 #include<iostream> 2 #include<cstring> 3 using namespace std; 4 int map[110][110]; 5 int main() 6 { 7 int i,j,n; 8 while(cin>>n) 9 { 10 memset(map,0,sizeof(map));//初始化数组; 11 for(i=1;i<=n;i++) 12 for(j=1;j<=i;j++) 13 cin>>map[i][j]; 14 for(i=n-1;i>=1;i--) 15 for(j=1;j<=i;j++) 16 map[i][j]=max(map[i][j]+map[i+1][j],map[i][j]+map[i+1][j+1]);//判断这个节点下面的两个子节点,取最大的一个; 17 cout<<map[1][1]<<endl; 18 } 19 return 0; 20 }