NYoj18 The Triangle
来源:互联网 发布:知彼网络 编辑:程序博客网 时间:2024/05/23 12:51
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
- 解题思路:从倒数第二层开始,逐个累加它对应的下一层的元素和相邻的元素比较大的那个,循环直到第一层第一个元素即为最大
- a[i][j] += (a[i+1][j] > a[i+1][j+1])? a[i+1][j] : a[i+1][j+1];
#include <stdio.h>int main(){ int i,j,n,a[101][101]; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<=i;j++) scanf("%d",&a[i][j]); for(i=n-2;i>=0;i--) for(j=0;j<=i;j++) a[i][j] += (a[i+1][j] > a[i+1][j+1])? a[i+1][j] : a[i+1][j+1]; printf("%d\n",a[0][0]); return 0;}
0 0
- NYOJ18 The Triangle
- NYoj18 The Triangle
- nyoj18 The Triangle
- NYOJ18——The Triangle
- nyoj18 The triangles 【DP】
- nyoj18 The Triangle & hdu2084 & nyoj171 聪明的KK 数塔(动态规划初步)
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- The triangle
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- The Triangle
- ElasticSearch-2.0.0集群安装配置与API使用实践
- GridView OnItemClickListener无法响应点击事件的解决
- TextView,Button实现滚动字幕
- hdu1542(矩形面积并)
- [Andorid开发艺术探索 读书笔记]View的事件体系(二)
- NYoj18 The Triangle
- Centos7操作系统下修改yum源的方法
- apktool反编译详细使用教程
- hdu3377plan【哈密顿路径插头Dp】
- build makefile for my coding!!
- My understand of "iptables"
- shell 编程语法总结(I/O 逻辑控制结构)
- My understand of stack and queue
- My understand of KMP describe in C