HDU 1087 Super Jumping! Jumping! Jumping! DP
来源:互联网 发布:淘宝定金链接怎么发货 编辑:程序博客网 时间:2024/04/19 23:04
Super Jumping! Jumping! Jumping!Crawling in process...
Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
Input
Output
Sample Input
Sample Output
Hint
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题意 : 每次可以跳到比当前位置大的点上 每跳一次获得当前位置的值 求能获得的最大值思路: 上升子序列求和AC代码:#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<queue>using namespace std;#define N 2010#define INF 0x3fffffffint dp[N];int v[N];int main(){int n, k, i, j, ans;while (scanf("%d", &n) != EOF){if (n == 0) break;memset(dp, 0, sizeof(dp));for (i = 1; i <= n; i++){scanf("%d", &v[i]);}dp[1] = v[1];for (i = 2; i <= n; i++){dp[i] = v[i]; //注意可以一步调到 i 位置for (j = 1; j < i; j++){if (v[i] > v[j]) //比较值大小dp[i] = max(dp[j] + v[i], dp[i]); }}for (i = 1, ans = 0; i <= n; i++){ans = max(dp[i], ans); //取上升子序列的最大值(不一定是最大上升子序列的值)}printf("%d\n", ans);}return 0;}
0 0
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!【dp】
- HDU-1087 Super Jumping! Jumping! Jumping! (DP)
- HDU-1087 Super Jumping! Jumping! Jumping!(DP)
- oracle学习(1)--------windows环境下的安装和基本操作
- loader
- Mybatis中什么时候应该声明jdbcType
- Windows上创建文件夹链接
- 侧滑
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- Virtex-5 FPGA Embedded Tri-Mode Ethernet MAC Wrapper v1.8分析
- java形参实参
- easyUI 日期控件修改...
- Shadertoy-4D Grid Slice
- HDU 4588--二进制的加法进位统计
- 双击返回,退出应用。
- 记录一下自己遇到的问题而已
- 【刷题之路】数字在排序数组中出现的次数