The Triangle
2016-07-05 18:00
162 查看
Problem Description
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 <iostream>
using namespace std;
int Max(int a,int b);
int main()
{
int n,dp[105][105];
cin>>n;
int i,j;
for(i=0;i<n;i++){
for(j=0;j<=i;j++){
cin>>dp[i][j];
}
}
for(i=n-2;i>=0;--i){
for(j=0;j<=i;++j){
dp[i][j]=dp[i][j]+Max(dp[i+1][j],dp[i+1][j+1]);
}
}
cout << dp[0][0] << endl;
return 0;
}
int Max(int a,int b){
return (a>b?a:b);
}
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 <iostream>
using namespace std;
int Max(int a,int b);
int main()
{
int n,dp[105][105];
cin>>n;
int i,j;
for(i=0;i<n;i++){
for(j=0;j<=i;j++){
cin>>dp[i][j];
}
}
for(i=n-2;i>=0;--i){
for(j=0;j<=i;++j){
dp[i][j]=dp[i][j]+Max(dp[i+1][j],dp[i+1][j+1]);
}
}
cout << dp[0][0] << endl;
return 0;
}
int Max(int a,int b){
return (a>b?a:b);
}
相关文章推荐
- java集合1
- getaddrinfo函数ipv6的应用
- ecplise 使用link方式安装 SVN
- Tensorflow: recurrent neural network char-level 1
- 简单掌握Python中glob模块查找文件路径的用法
- Lua 中实现面向对象
- NOI 2002 营业额统计 (splay or fhq treap)
- Eclipse快捷键 10个最有用的快捷键
- 布局属性layout_weight解析
- Git提交代码流程
- NOI 2002 营业额统计
- OpenGL的GLUT注册回调函数[转]
- input放在a标签里面不能选择input里面的文本,IE9点击失效
- shutil复制粘贴和压缩
- CSS3媒体查询
- php 简单分页类
- Problem W
- 【Swift】从前台进入后台,从后台进入前台
- address already in use
- Linux下几种文件传输命令 sz rz sftp scp