POJ1163 数字三角形（动态规划）

The Triangle

Description

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

题目大意：

从数字三角形中寻找一条从顶部到底边的路径，使得路径上经过的数字之和最大。每一步都只能往左下或右下走，求出最大和。

解题思路：

动态规划，推出动态转移方程，用一维数组maxsum[101]，只需存储一行maxsum值
maxsum[ j ] = max ( maxsum[ j ],maxsum[ j + 1 ] ) + D[ i ][ j ]

代码如下：

C++

#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

int D[101][101];
int n;
int * maxsum;
int main(){
	int i,j;
	cin>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=i;j++)
			cin>>D[i][j]; //输入数字三角形
	maxsum = D[n]; //指向第n行
	for(int i=n-1;i>=1;i--)
		for(int j=1;j<=i;j++)
			maxsum[j]=max(maxsum[j],maxsum[j+1])+D[i][j];
	cout<<maxsum[1]<<endl;
	return 0;
}

Java

import java.util.Scanner;

public class 数字三角形 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] D = new int[101][101];
		int[] maxsum = new int[101];
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= i; j++)
				D[i][j] = sc.nextInt();//输入数字三角形
				maxsum = D[n];
		for (int i = n - 1; i >= 1; i--)
			for (int j = 1; j <= i; j++)
				maxsum[j] = Math.max(maxsum[j], maxsum[j + 1]) + D[i][j];
		System.out.println(maxsum[1]);
	}
}