nyoj 18 The Triangle
来源:互联网 发布:java读取xml文件内容 编辑:程序博客网 时间:2024/05/17 06:58
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<iostream>#include<stdio.h>#include<algorithm>using namespace std;#define N 101int *maxnum;int d[N][N];int main(){int n,i,j;scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=i;j++)scanf("%d",&d[i][j]);maxnum=d[n];for(i=n-1;i>=1;--i)for(j=1;j<=i;++j){maxnum[j]=max(maxnum[j],maxnum[j+1]) +d[i][j];}printf("%d\n",maxnum[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(数塔)
- 傅立叶变换学习(一)初步认识傅立叶变换
- PHP函数stream_context_create()模拟POST/GET
- HDU-Kanade's sum-模拟
- 分享一款Android开源的仿IOS滚轮效果的控件
- HDU 6121 思维 + DFS
- nyoj 18 The Triangle
- 解决引入Dragger2时的等注入依赖报的错: Gradle DSL method not found: 'apt()'
- ClippingNode
- 20170816——Yi+图像算法实习生
- 关于JVM和(堆和栈的区别)
- 文章标题 POJ 3281 : Dining (最大流+巧妙建图)
- Ubuntu 14.04 上使用 Nginx 部署 Laravel
- 使用hadoop对一组数据排序,求平均值。
- Python中的逗号作用