1087Super Jumping! Jumping! Jumping!
来源:互联网 发布:海外出差 知乎 编辑:程序博客网 时间:2024/05/29 23:47
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25894 Accepted Submission(s): 11466
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.
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.
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 24 1 2 3 44 3 3 2 10
Sample Output
4103
这道题其实就是求单调递增子序列和最大,跟最长差不多,做着题的时候,忽略了起点是零,所以以为不会过呢,谁知道结果竟然过了。然后才注意到起点是0
#include <iostream>#include<cstdio>#include<cstring>using namespace std;int a[1000+5];int dp[1000+5];int main(){ int n; while(scanf("%d",&n)!=EOF&&n) { for(int i=1;i<=n;i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); dp[1]=a[1]; int ans=0; for(int i=2;i<=n;i++) { int maxn=0,j; for(j=i-1;j>0;j--) if(a[i]>a[j]) if(maxn<dp[j]) maxn=dp[j]; dp[i]=maxn+a[i]; if(ans<dp[i]) ans=dp[i]; } printf("%d\n",ans); } return 0;}
0 0
- 1087 Super Jumping! Jumping Jumping!
- Super Jumping! Jumping! Jumping! 1087
- 1087 Super Jumping! Jumping! Jumping!
- 1087Super Jumping! Jumping! Jumping!
- 1087 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!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Java中volatile关键字的作用
- Longest Palindromic Substring
- My智能家居使用(乐联平台)
- EditText数据回显
- ViewPager+FragmentPagerAdapter实现微信5.2.1主界面架构
- 1087Super Jumping! Jumping! Jumping!
- 常见排序算法总结(java版)
- spark:学习杂记--39
- 欢迎使用CSDN-markdown编辑器
- ssao
- Equations(哈希)
- 一起talk Vim吧(第五回:Vim无影刀法)
- leetCode #203 remove linked list elements
- 【数据结构】回顾栈ADT和队ADT