(acm) The Triangle
来源:互联网 发布:手机淘宝收货地址 编辑:程序博客网 时间:2024/06/05 03:43
The Triangle
时间限制: 1 Sec 内存限制: 128 MB提交: 5 解决: 1
[提交][状态][讨论版]
题目描述
73 88 1 02 7 4 44 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 <iostream>using namespace std;int max(int a,int b){ if(a>b) return a; return b;}int main(){ int a[200][200]; int n; cin>>n; int i,j; 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+1],a[i+1][j]); cout<<a[0][0]<<endl;}
1 0
- (acm) The Triangle
- PKU ACM 1163-The Triangle
- ACM pku 1163 The Triangle
- Pku acm 1163 the Triangle
- ACM ICPC 1163 The Triangle
- 【ACM菜逼解题报告】The Triangle(POJ1163)
- ACM学习-POJ-1163-The Triangle
- ACM POJ 1163 The Triangle DP
- 南阳理工acm 18 The Triangle
- The Triangle(记搜)
- The Triangle(简单DP)
- The Triangle(数塔)
- The Triangle(POJ-1163)
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- The triangle
- 数据库操作语句大全(sql)
- 性能优化之大纲
- GOF设计模式之TEMPLATE METHOD(模板方法)
- ThinkPHP-登陆操作
- Android动画机制
- (acm) The Triangle
- APK 打包过程
- linux下压缩文件命令集合
- 结构体数组
- 单链表的插入和删除
- Sublime Text 格式化代码快捷键自定义
- Solr查询参数fq
- axis2简单例子
- 机器大小端的检测