NYOJ The Triangle
2016-05-21 17:58
246 查看
The Triangle
时间限制:1000 ms | 内存限制:65535KB
难度: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 <iostream> using namespace std; const int N = 105; int a ; int main(){ int i,j,n; cin>>n; for(i=0;i<n;i++){ for(j=0;j<=i;j++) cin>>a[i][j];} for(i=n-2;i>=0;i--){ for(j=0;j<=i;j++) a[i][j]+=max(a[i+1][j],a[i+1][j+1]); } cout<<a[0][0]<<endl; return 0; }
相关文章推荐
- 深入理解java虚拟机 精华总结(面试)
- Error 'LINK : fatal error LNK1123: failure during conversion to COFF: file invalid or corrupt' after
- 学习MongoDB 十: MongoDB聚合(Map-Reduce)(二)
- DeDeCMS二次开发教程之静态页面生成流程
- max()和数组里面的max
- cocos2dx js 关于canvas绘图模糊问题及解决办法
- 线程池
- linux redis日志文件路径的设置
- 常用的机器学习&数据挖掘知识点[转]
- library not found for -xxx
- k-近临算法及代码实现
- QQ亿级日活跃业务后台核心技术揭秘
- Bundle的使用
- 【经典算法】——KMP,深入讲解next数组的求解
- redis ,hash
- C# dbf文件在dataGirdView控件中显示方法
- 基于正则表达式(python)对东方财富网上证指数吧爬虫实例
- 【opencv】普通相机标定畸变校正
- 程序是怎样跑起来的-第05章 内存和磁盘的亲密关系
- Miller_rabin算法+Pollard_rho算法 POJ 1811 Prime Test