NYOJ 18 The Triangle
来源:互联网 发布:日本留学的好专业知乎 编辑:程序博客网 时间:2024/05/16 11:43
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.
- 样例输入
573 88 1 0 2 7 4 44 5 2 6 5
- 样例输出
30
- 上传者
苗栋栋
从下往上遍历
#include<stdio.h>#include<algorithm>using namespace std;int map[105][105];int main(){int n;scanf("%d",&n);for(int i=1;i<=n;i++)for(int j=1;j<=i;j++)scanf("%d",&map[i][j]);for(int i=n-1;i>=0;i--)for(int j=1;j<=i;j++)map[i][j]=map[i][j]+max(map[i+1][j],map[i+1][j+1]);printf("%d\n",map[1][1]);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(数塔)
- 【leetcode】660. Remove 9 c++代码
- 性能测试java协议使用httpclient方法引发的思考
- Java中Http连接的两种方式
- 详解易经64卦-傅佩荣有声系列2
- 集合(三)泛型
- NYOJ 18 The Triangle
- Rust :公钥、私钥与keypair、signature、verify 三部曲
- hdu1083 Java 二分图
- 百度语音——语音识别(简易教程)
- Js对象的学习
- http请求 405错误 方法不被允许 (Method not allowed)
- 好数
- CIFS文件系统
- Android中几种数据结构使用