HDOJ-----1087Super Jumping! Jumping! Jumping!(DP)
来源:互联网 发布:c语言画线函数 编辑:程序博客网 时间:2024/06/02 01:45
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33937 Accepted Submission(s): 15374
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
最大递增子序列和
状态转移方程dp[i] = max(dp[j])+cnt[i] ( 1 <= j < i)
#include<cstdio>#include<cstring>#include<algorithm>#define maxn 1010#define ll long long#define inf 0x3f3f3f3fusing namespace std;ll ans, dp[maxn], cnt[maxn];int n;void DP(){ dp[1] = cnt[1]; ans = 0; for(int i = 2; i <= n; i++){ for(int j = 1; j < i; j++){ if(cnt[j] < cnt[i]){ dp[i] = max(dp[i], dp[j]+cnt[i]); } } dp[i] = max(dp[i], cnt[i]); ans = max(ans, dp[i]); }}int main(){ while(~scanf("%d", &n), n){ memset(dp, 0, sizeof(dp)); memset(cnt, 0, sizeof(cnt)); for(int i = 1; i <= n; i++){ scanf("%d", &cnt[i]); } DP(); printf("%lld\n", ans); } return 0;}
0 0
- hdoj 1087Super Jumping! Jumping! Jumping!【dp】
- HDOJ 1087 Super Jumping! Jumping! Jumping!(DP)
- hdoj 1087Super Jumping! Jumping! Jumping!《《dp》》
- HDOJ 1087-Super Jumping! Jumping! Jumping!【DP】
- HDOJ 1087 Super Jumping! Jumping! Jumping! (dp)
- HDOJ-----1087Super Jumping! Jumping! Jumping!(DP)
- HDOJ 1087 Super Jumping! Jumping! Jumping! (DP)
- HDOJ 1087 Super Jumping! Jumping! Jumping!简单DP
- hdoj.1087 Super Jumping! Jumping! Jumping!【DP】 2015/03/27
- HDOJ/HDU 1087 Super Jumping! Jumping! Jumping!(经典DP~)
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- 进程间通信——AIDL实例演示
- 安装python3.5.2 error code is 2503
- JAVA学习代码——File文件
- div完成田字格布局
- 对MIME(Multipurpose Internet Mail Extensions)的简介
- HDOJ-----1087Super Jumping! Jumping! Jumping!(DP)
- tyvj 1008 传球游戏
- Arduino 双机通信 +类型转换(解决nodemcu引脚不够用咋办的问题)(此方案已经淘汰,查看最新版本)
- 循环链表-约瑟夫问题
- poj 2407 欧拉函数
- GOF之结构型模式总结
- Linux 下 安装 Redis
- 汽车之家手机端
- 【HDU】-5773-The All-purpose Zero(LIS变形,思维)