The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 38664 | Accepted: 23203 |
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[i][j]=max{dp[i+1][j],dp[i+1][j+1]}+map[i][j]
#include<stdio.h>
#include<string.h>
int N;
int map[101][101];
int dp[101][101];
int max(int a,int b){
return a>b?a:b;
}
int main(int argc, char *argv[])
{
while(~scanf("%d",&N))
{
memset(map,0,sizeof(map));
memset(dp,0,sizeof(dp));
for(int i=0;i<N;++i)
for(int j=0;j<=i;++j)
{
scanf("%d",&map[i][j]);
}
for(int i=N-1;i>=0;--i)
for(int j=0;j<=i;++j)
{
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+map[i][j];
}
printf("%d\n",dp[0][0]);
}
return 0;
}