playboy307

Java,golang后台开发,欢迎互相交流学习

nyoj--18--The Triangle(dp水题)

The Triangle

时间限制:1000 ms  |  内存限制:65535 KB
难度:4
描述

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.

输入
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.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0 
2 7 4 4
4 5 2 6 5
样例输出
30

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAX 210
int dp[MAX][MAX];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=i;j++)
			scanf("%d",&dp[i][j]);
		}
		for(int i=n-1;i>=1;i--)
		{
			for(int j=1;j<=n;j++)
			dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]);
		}
		printf("%d\n",dp[1][1]);
	}
	return 0;
}



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_29963431/article/details/49934761
个人分类: 动态规划
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

nyoj--18--The Triangle(dp水题)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭