POJ1163 The Triangle（DP入门）

7
3   8
8   1   0
2   7   4   4
4   5   2   6   5

(Figure 1)

Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.

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入门

从最后一层往上推，每一个数从左右两边选出一个较大的数与该数相加，得到递推式：

dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];

注意初始化dp数组

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int a[110][110],dp[110][110];

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=i;j++)
			{
				scanf("%d",&a[i][j]);
			}
		}
		for(int i=n;i>=1;i--)
		{
			for(int j=1;j<=i;j++)
			{
				dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
			}
		}
		printf("%d\n",dp[1][1]);
	}
	return 0;
}