The Triangle——POJ-1163（动态规划）

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

2.题目分析

（1）题意说明

从顶到底找到一条路 ，每行一个数，只可以在斜上和斜下方向走，使这条路上的数字之和最大。

（2）

数字三角形问题，采用动态规划求解
自顶向下或自底向上找递推关系：
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
1.设置变量
a[r][j]表示第r行第j个数字（r,j从1开始算）
目标 maxsum(r,j)：从a[r][j]到底边的各条路径中，最佳路径的数字之和
2.递推关系
从下往上，d(i,j) = a(i,j) + max{d(i+1,j),d(i+1,j+1)}
a和d可以用一个变量表示

（2）代码

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
	int n;
	int a[100][100];
	
	cin>>n;
	for(int i=0;i<n;i++){//输入原始数据
		for(int j=0;j<=i;j++)
			cin>>a[i][j];
	}
	
	for(int i=n-2;i>=0;i--){//从倒数第二行开始遍历
		for(int j=0;j<=i;j++){
			a[i][j]+=(a[i+1][j]>a[i+1][j+1])?a[i+1][j]:a[i+1][j+1];
		}
	}
	cout<<a[0][0]<<endl;//代表从第0行到底的最佳路径之和
	return 0;
}