xmu 1010
来源:互联网 发布:论坛优化方案 编辑:程序博客网 时间:2024/05/16 00:30
Description
Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be 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.
3 8
8 1 0
2 7 4 4
4 5 2 6 5
In the sample above, the route from 7 to 3 to 8 to 7 to 5 produces the highest sum: 30.
The first line contains R (1 <= R <= 1000), the number of rows. Each subsequent line contains the integers for that particular row of the triangle. All the supplied integers are non-negative and no larger than 100.
A single line containing the largest sum using the traversal specified.
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
30
Huge input, scanf is recommended if you are using C++.
如果从数字堆的顶部出发,那么每次都有两个选择(无法用贪心),要一个个的试验一次,那么时间的复杂度是O(2^k),k为数字堆的层数。换一种思路,如果从底部出发,每次都选上层相邻比较大的数跟自己相加,这种的贪心策略可以保证结果的真确性,而且复杂度为O(k^2),k为数字堆的层数。
#include <stdio.h>#define maxn 1005int v[maxn][maxn];int main(){int n;int i, j;long temp;scanf("%d", &n);for (i=0; i<n; i++){for (j=0; j<i+1; j++){scanf("%ld", &v[i][j]);}}for (i=n-2; i>=0; i--){for (j=0; j<=i; j++){temp = v[i+1][j]>v[i+1][j+1] ? v[i+1][j]:v[i+1][j+1];v[i][j] += temp;}}printf("%ld\n", v[0][0]);return 0;}
- xmu 1010
- xmu 1024
- XMU 1255
- xmu 1325
- xmu 1326
- xmu 1228
- xmu 1004
- xmu 1005
- xmu 1006
- xmu 1007
- xmu 1008
- xmu 1009
- xmu 1011
- xmu 1012
- xmu 1015
- xmu 1017
- xmu acm 1029
- xmu acm 1055
- [leetcode]Reverse Nodes in k-Group
- Android开发学习笔记:浅谈WebView
- 线性链表中形参中的指针引用的问题
- JFrame的层次结构
- 微信营销诀窍:真实粉丝和有效听众才是公众号推广的必备要求
- xmu 1010
- JSP九大内置对象
- cocos2dx中关于粒子系统(particleSystem)的一些属性的设置
- 一元线性回归分析
- 再给大家发个小游戏,打鱼儿的源代码 纯 Cocos2d-x
- 从零单排入门机器学习:OctaveMatlab的常用知识之画图
- 几种同步手段(互斥量,信号量,事件,临界区)
- 黑马程序员_【总结】_集合框架知识梳理4_(end)
- 动态修改UINavigationBar背景