POJ1163 The Triangle
来源:互联网 发布:如何建立网络平台 编辑:程序博客网 时间:2024/06/16 19:31
题目:
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
Source
IOI 1994
解答:
//POJ1163 //A//B C//D E F//G H I J//K L M N O//P Q R S T U/*#include<iostream>#include<algorithm>#define MAX 101using namespace std;int D[MAX][MAX];int n;int MaxSum(int i,int j){ if(i==n)return D[i][j]; int x=MaxSum(i+1,j),y=MaxSum(i+1,j+1); return max(x,y)+D[i][j];}int main(){ int i,j; cin>>n; for(i=1;i<=n;i++) for(j=1;j<=i;j++){ cin>>D[i][j]; } cout<<MaxSum(1,1)<<endl; return 0;}//超时 *//*#include<iostream>#include<algorithm>#define MAX 101using namespace std;int D[MAX][MAX];int maxSum[MAX][MAX];/////////////////////////////////int n;int MaxSum(int i,int j){ if(maxSum[i][j]!=-1)return maxSum[i][j];////////// if(i==n)return D[i][j]; int x=MaxSum(i+1,j),y=MaxSum(i+1,j+1); return max(x,y)+D[i][j];}int main(){ int i,j; cin>>n; for(i=1;i<=n;i++) for(j=1;j<=i;j++){ cin>>D[i][j]; maxSum[i][j]=-1;////////////////////////// } cout<<MaxSum(1,1)<<endl; return 0;}////////数字三角形的记忆递归型动态规划程序。 *//* //递归变递推:#include<iostream>#include<algorithm>#define MAX 101using namespace std;int D[MAX][MAX];int maxSum[MAX][MAX];int n;int main(){ int i,j; cin>>n; for(int i=1;i<=n;i++)for(int j=1;j<=i;j++)cin>>D[i][j]; for(int i=1;i<=n;i++)maxSum[n][i]=D[n][i]; for(int i=n-1;i>=1;i--)for(int j=1;j<=i;j++)maxSum[i][j]=max(maxSum[i+1][j],maxSum[i+1][j+1])+D[i][j]; cout<<maxSum[1][1]<<endl; return 0;}*/ //继续空间优化 //将maxSum二维数组换成一维 //利用滚动数组,把原本上一行的运算数值保存在这一行。 #include<iostream>#include<algorithm>#define MAX 101using namespace std;int D[MAX][MAX];int maxSum[MAX];int n;int main(){ int i,j; cin>>n; for(int i=1;i<=n;i++)for(int j=1;j<=i;j++)cin>>D[i][j]; for(int i=1;i<=n;i++)maxSum[i]=D[n][i]; 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;}
- POJ1163 The Triangle
- POJ1163:The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle 【DP】
- POJ1163 The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle
- poj1163 the triangle 题解
- POJ1163 The Triangle
- POJ1163 The Triangle 题解
- POJ1163 The Triangle
- poj1163 dp the triangle
- POJ1163 The Triangle
- poj1163 The Triangle
- poj1163 The Triangle
- The Triangle(poj1163)
- POJ1163 The Triangle【DFS】
- Strategic game
- opencv 鼠标截取图像
- 树的遍历(递归与非递归版本)
- 梯度与导数的关系
- (1)大学第一节C++课
- POJ1163 The Triangle
- 面向对象实现各种数据结构
- 计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛J题Our Journey of Dalian Ends (最小费用最大流)
- PAT乙级1061. 判断题(15)
- imagemagick向图片中写文字
- Windows下 tensorboard显示空白 以及 No graph definition files were found的问题解决
- 记录自已学习之CVTE笔试后感
- js实现表格的增删改查
- 开通www 国际域名个人网站操作介绍