nyoj 18The Triangle
来源:互联网 发布:雷霆队数据 编辑:程序博客网 时间:2024/05/17 07:31
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
上传者
时间限制: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<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,shu[105][105],he[105][105];int main(){while (~scanf("%d",&n)){memset(shu,0,sizeof(shu));memset(he,0,sizeof(he));for (int i=1;i<=n;i++){for (int j=1;j<=i;j++)scanf("%d",&shu[i][j]);}for (int i=1;i<=n;i++){ for (int j=1;j<=i;j++) { he[i][j]=max(he[i-1][j],he[i-1][j-1])+shu[i][j];}}sort(he[n]+1,he[n]+n+1);printf("%d\n",he[n][n]);}return 0;}
0 0
- NYOJ 18 The Triangle
- NYOJ 18-The Triangle
- The Triangle(nyoj 18)
- nyoj-18-The Triangle
- NYOJ-18 The Triangle
- NYOJ 18 The Triangle
- The Triangle--nyoj 18
- nyoj 18The Triangle
- NYOJ 18 The Triangle
- NYOJ-18 The Triangle
- nyoj 18 The Triangle
- NYOJ 18 The Triangle
- NYOJ 题目18 The Triangle
- NYOJ 题目18 The Triangle
- nyoj 18 The Triangle 动态规划
- nyoj 18 The Triangle 【经典dp】
- NYOJ 18 The Triangle(简单dp)
- nyoj 18 The Triangle(数塔)
- 单例模式
- nginx配置性能优化
- hashmap造成死循环
- Apacche与Nginx优缺点比较
- java学习第一天
- nyoj 18The Triangle
- 批量更新操作,有则更新无则插入。
- 二叉树后序遍历的非递归算法
- Mysql主从复制
- 超级服务netd和xinetd
- 使用ScrollView属性fillViewport解决android布局不能撑满全屏的问题
- HDU NO.1285 确定比赛名次(拓扑排序+“字典序”问题)
- Ubuntu 16.04 配置中文输入法
- 进程和线程的区别