HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)
来源:互联网 发布:淘宝网最好的假发店 编辑:程序博客网 时间:2024/05/22 07:50
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24409 Accepted Submission(s): 10757
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
Author
lcy
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
题目大意:求最大上升子序列
题目分析:每次更新长度为i (1 <= i <= n)的子序列的值,最后取个最大值
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
题目大意:求最大上升子序列
题目分析:每次更新长度为i (1 <= i <= n)的子序列的值,最后取个最大值
#include <cstdio>int const MAX = 1005;int val[MAX], dp[MAX];int main(){ int n, ma; while(scanf("%d", &n) != EOF && n) { for(int i = 1; i <= n; i++) { scanf("%d", &val[i]); dp[i] = val[i]; } for(int i = 2; i <= n; i++) for(int j = 1; j < i; j++) if(val[j] < val[i] && dp[j] + val[i] > dp[i]) dp[i] = dp[j] + val[i]; ma = dp[0]; for(int i = 1; i <= n; i++) ma = dp[i] > ma ? dp[i] : ma; printf("%d\n", ma); }}
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:上升子序列最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- hdu 1087 Super Jumping! Jumping! Jumping!(上升子序列最大和)
- hdu 1087 Super Jumping! Jumping! Jumping! 最大上升子序列。模板题
- Hdu 1087 Super Jumping! Jumping! Jumping!【最大上升子序列和】
- hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
- HDU 1087 Super Jumping!Jumping!Jumping求连续上升子序列的最大和值 (解析)
- HDU 1087 Super Jumping! Jumping! Jumping!(求最大上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列)
- HDU-1087 Super Jumping! Jumping! Jumping!(上升子序列最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)
- 【HDU 1087】Super Jumping! Jumping! Jumping!(最大上升子序列和,动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping! 上升序列最大和+DP .
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- Android Drawable 那些不为人知的高效用法
- 【献给初学者】在wamp环境下php及mysql中文乱码解决方法(原来的账号丢了~所以重新发一次)
- poj2699 暴力+dinic
- 互联网一些创业idea和领域
- UVa10976 - Fractions Again?!
- HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)
- Leetcode:Repeated DNA Sequences
- 【献给初学者】WAMP环境下phpmyadmin连接遭拒绝
- 电风扇电风扇电风扇
- Java线程(一):线程安全与不安全
- Java线程(二):线程同步synchronized和volatile
- PHP使用GD库画简单的验证码
- Java线程(三):线程协作-生产者/消费者问题
- Python PyImport_ImportModule() 或者 PyImport_Import()失败问题