Super Jumping! Jumping! Jumping! HDU
来源:互联网 发布:多可网络爬虫 编辑:程序博客网 时间:2024/05/22 12:39
Super Jumping! Jumping! Jumping!
HDU - 1087Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.
The game can be played by two or more than two players. It consists of a chessboard(棋盘)and some chessmen(棋子), and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. In the course of jumping, the player will visit the chessmen in the path, but everyone must jumps from one chessman to another absolutely bigger (you can assume start-point is a minimum and end-point is a maximum.). And all players cannot go backwards. One jumping can go from a chessman to next, also can go across many chessmen, and even you can straightly get to end-point from start-point. Of course you get zero point in this situation. A player is a winner if and only if he can get a bigger score according to his jumping solution. Note that your score comes from the sum of value on the chessmen in you jumping path.
Your task is to output the maximum value according to the given chessmen list.
The game can be played by two or more than two players. It consists of a chessboard(棋盘)and some chessmen(棋子), and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. In the course of jumping, the player will visit the chessmen in the path, but everyone must jumps from one chessman to another absolutely bigger (you can assume start-point is a minimum and end-point is a maximum.). And all players cannot go backwards. One jumping can go from a chessman to next, also can go across many chessmen, and even you can straightly get to end-point from start-point. Of course you get zero point in this situation. A player is a winner if and only if he can get a bigger score according to his jumping solution. Note that your score comes from the sum of value on the chessmen in you jumping path.
Your task is to output the maximum value according to the given chessmen list.
N value_1 value_2 …value_N
It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.
A test case starting with 0 terminates the input and this test case is not to be processed.
3 1 3 24 1 2 3 44 3 3 2 10
4103
题意:每行第一个数为n,后面n个数,从第一个数开始到最后(可跳跃),但是必须只能按照数的上升顺序走,每走一步,sum加上这一步的值,求在路径中能获得的最大sum值。
AC代码:
#include<iostream>#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#define maxn 1010using namespace std;int main(){int n,a[maxn],dp[maxn],i,j,maxdp;while(scanf("%d",&n)!=EOF){if(n==0)break;for(i=1;i<=n;++i){scanf("%d",&a[i]);dp[i]=a[i];}for(i=2;i<=n;++i){for(j=1;j<i;++j){if(a[i]>a[j]&&dp[i]<dp[j]+a[i]){dp[i]=dp[j]+a[i];}}}maxdp=-1;for(i=1;i<=n;++i){if(dp[i]>maxdp)maxdp=dp[i];}cout<<maxdp<<endl;}return 0;}
阅读全文
0 0
- HDU Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- 认识数据-数据对象与数据类型
- JavaScript中常用语句
- Java面试近一个月的面试总结
- 安装好DELPHI XE10,参照手册简单的创建了一个android app 程序,run的时提示: Android SDK tools are required. Do you want to d
- VMware一些使用心得
- Super Jumping! Jumping! Jumping! HDU
- 一个基于C++的多线程编程实例(CreateThread函数)
- Codeforces 151C(分解因数)
- Apache Mesos Essentials.pdf 英文原版 免费下载
- 神经网络中的关键算法
- 一期回顾之刷数组有感
- HDU P1002 A + B Problem II
- An introduction to smoothing--forcked from matthew-brett
- Aerospike insert、drop、read和emigrate加锁及引用计数流程