动态规划 数字三角形 poj1163
来源:互联网 发布:风险矩阵图案例 编辑:程序博客网 时间:2024/06/06 01:17
The Triangle
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 51078 Accepted: 30942
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
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 51078 Accepted: 30942
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
题意:从顶点出发找到一条max值的路线 输出max值
题解:因为只能往左下或者右下走 所以只要
int x = maxsum(i+1,j); int y = maxsum(i+1,j+1); maxsum1[i][j]=max(x,y)+d[i][j];
为了提高效率 可以使用一个数组记录下来之前算的结果 避免重复计算
#include <iomanip>#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<queue>#include<algorithm>#include<cmath>#define maxn 105using namespace std;int d[maxn][maxn];int n;int maxsum1[maxn][maxn];int maxsum(int i,int j){ if(maxsum1[i][j]!=-1) return maxsum1[i][j]; if(i==n) maxsum1[i][j]=d[i][j]; else{ int x = maxsum(i+1,j); int y = maxsum(i+1,j+1); maxsum1[i][j]=max(x,y)+d[i][j]; } return maxsum1[i][j];}int main(){ cin>>n; for(int i = 1;i<=n;i++){ for(int j = 1;j<=i;j++){ cin>>d[i][j]; maxsum1[i][j]= -1;}} cout<<maxsum(1,1)<<endl; return 0;}
阅读全文
0 0
- 动态规划 数字三角形 poj1163
- 数字三角形动态规划poj1163
- 数字三角形(动态规划)poj1163
- 动态规划略有所得 数字三角形(POJ1163)
- 动态规划--(数字三角形 poj1163)
- 动态规划--再论(数字三角形 poj1163)
- 动态规划——POJ1163数字三角形问题
- POJ1163 The Triangle(数字三角形) (动态规划初步)
- [PKU暑课笔记] 动态规划 POJ1163数字三角形
- poj1163(数字三角形)
- 数字三角形(POJ1163)
- DP 数字三角形(POJ1163)
- POJ1163数字三角形
- poj1163数字三角形
- POJ1163 数字三角形
- 动态规划----数字三角形
- 数字三角形 动态规划
- 动态规划:数字三角形
- ccf 201412-4最优灌溉100
- ccf 201409-4最优配餐
- ccf 201403-4无线网络
- ccf 201312-5I’m stuck!
- springmvc的 自定义转换器(converter)实现方法
- 动态规划 数字三角形 poj1163
- Ubuntu16.04和WindowsXP双系统开机出现grub rescure 解决方案
- Linus实验楼笔记——第4节:Linux 目录结构及文件基本操作
- springboot -dubbo-ssm的最新开源商城
- layout_gravity与gravity的区别,和padding margin的区别
- hdu 2068 错排+组合
- 在win7 32位下使用mongoDB遇到的问题及解决
- 简析TCP的三次握手与四次分手
- hdu 1106