POJ-4003 The Triangle (线性dp,入门题)

本文介绍了一个经典的算法问题——三角形路径最大和问题。该问题是寻找从三角形顶点到底边的最大数值路径。文章提供了完整的C++代码实现,并解释了动态规划方法的应用。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

The Triangle
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 51932 Accepted: 31380

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



#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int a[102][102], dp[102];
int main(){
	int n;
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= i; ++j){
			scanf("%d", &a[i][j]);
		}
	}
	memset(dp, 0, sizeof(dp));
	for(int i = n; i >= 0; --i){
		for(int j = 1; j <= n; ++j){
			dp[j] = max(dp[j], dp[j + 1]) + a[i][j];
		}
	}
	printf("%d\n", dp[1]);	
}

/*
题意:
一个三角形,求从定点到底部的最大和路径。

思路:
线性dp,dp[j]表示某行第j个位置向下的最大和。滚动一下减少空间开销。
*/


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值