Super Jumping! Jumping! Jumping! |
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 156 Accepted Submission(s): 97 |
|
Problem Description
Nowadays, 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. |
|
Input
Input contains multiple test cases. Each test case is described in a line as follow:
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. |
|
Output
For each case, print the maximum according to rules, and one line one case.
|
|
Sample Input
3 1 3 2
4 1 2 3 4
4 3 3 2 1
0
|
|
Sample Output
4
10
3
状态转移方程为：f[i] = max(f[k]+num[i]),1 <=k<i;
#include <iostream> using namespace std; int main() { int N,num[1001],f[1001],max; while(cin>>N&&N) { //max = 0; cin>>num[1]; f[1] = num[1]; max = num[1]; for(int i = 2; i <=N ; i++) { cin>>num[i]; f[i] = num[i]; for(int j = 1; j < i ; j++) { if(num[i]>num[j]) { if(f[i]<f[j]+num[i ]) {
max = f[i];
本文转自NewPanderKing51CTO博客，原文链接： http://www.cnblogs.com/newpanderking/archive/2011/08/04/2127049.html，如需转载请自行联系原作者
|
HDU Super Jumping! Jumping! Jumping!
2017-11-15
983
版权
版权声明：
本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《
阿里云开发者社区用户服务协议》和
《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写
侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。
简介：
目录
相关文章
|
6月前
|
机器学习/深度学习
|
Go
HDOJ/HDU 1087 Super Jumping! Jumping! Jumping!(经典DP~)
HDOJ/HDU 1087 Super Jumping! Jumping! Jumping!(经典DP~)
83
0
0
|
C++
C++ Exercises（五）
1102
0
0
|
C++
C++ Exercises（十）
1103
0
0
|
C++
人工智能
C++ Exercises（八）
751
0
0
|
C++
C++ Exercises（六）
989
0
0
|
C++
C++ Exercises（一）
834
0
0
|
C++
C++ Exercises（七）
1098
0
0
|
C++
C++ Exercises（九）
992
0
0