[IOI1999][USACO1.5]数字三角形 Number Triangles 动态规划

本文链接：https://blog.csdn.net/yjy_aii/article/details/85345828

题目

Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be 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.

      7

    3   8

  8   1   0

2   7   4   4

4 5 2 6 5
In the sample above, the route from 7 to 3 to 8 to 7 to 5 produces the highest sum: 30.

观察下面的数字金字塔。

写一个程序来查找从最高点到底部任意处结束的路径，使路径经过数字的和最大。每一步可以走到左下方的点也可以到达右下方的点。

     7 
  3   8 
8   1   0

2 7 4 4
4 5 2 6 5
在上面的样例中,从7 到 3 到 8 到 7 到 5 的路径产生了最大

题解

动态规划模板

代码

/*
ID: yjy_aii1
TASK: numtri
LANG: C++
*/
#include <cstdio>
#include <algorithm>

using namespace std;

int n;
int a[1005][1005];

int main(){
	freopen("numtri.in","r",stdin);
	freopen("numtri.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=i;j++)
			scanf("%d",&a[i][j]);
	for (int i=2;i<=n;i++)
		for (int j=1;j<=i;j++)
			a[i][j]+=max(a[i-1][j],a[i-1][j-1]);
	int ans=0;
	for (int i=1;i<=n;i++)
		if (a[n][i]>ans) ans=a[n][i];
	printf("%d\n",ans);
}