hdoj1087Super Jumping! Jumping! Jumping!(上升序列求最大和)
2016-08-18 20:59
330 查看
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.
![](http://acm.split.hdu.edu.cn/data/images/1087-1.jpg)
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此题数据范围小,之间暴力O(n*n)即可,在最长上升序列(O(n*n))的模板上稍加修改即可代码如下:
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.
![](http://acm.split.hdu.edu.cn/data/images/1087-1.jpg)
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此题数据范围小,之间暴力O(n*n)即可,在最长上升序列(O(n*n))的模板上稍加修改即可代码如下:
#include<cstdio> #include<cstring> #include<algorithm> #define INF 0x3f3f3f3f using namespace std; int a[1010]; int dp[1010]; int n,i,j; int main() { while(scanf("%d",&n),n) { for(i=1;i<=n;i++) { scanf("%d",&a[i]); } int ans=-1; for(i=1;i<=n;i++) { dp[i]=a[i]; for(j=1;j<=i;j++) { if(a[j]<a[i]) { dp[i]=max(dp[i],dp[j]+a[i]); } } ans=max(ans,dp[i]);//最长上升序列的总和不一定最大,所以在这比一下. } printf("%d\n",ans); } }
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)
- HDU-1087 Super Jumping! Jumping! Jumping! (线性dp 上升子序列最大和)
- hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )
- hdoj--1087--Super Jumping! Jumping! Jumping!(最长上升序列)
- HDU-1087 Super Jumping! Jumping! Jumping!(上升子序列最大和)
- HDU 1087 Super Jumping! Jumping! Jumping! 最大连续子序列和
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列)
- HDU1087 Super Jumping! Jumping! Jumping! DP求非连续单调递增序列的最大和
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
- Super Jumping! Jumping! Jumping! 【hdu-1087】【动态规划-最长上升子序列】
- HDU 1087 Super Jumping! Jumping! Jumping! (求最大上升子序列和,动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!(基础DP,最大上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
- Super Jumping! Jumping! Jumping! HDU - 1087(dp,上升子串求最大和)
- HDU 1087 Super Jumping! Jumping! Jumping! --- DP入门之最大上升子序列
- 每日三题-Day2-C(HDU 1087 Super Jumping! Jumping! Jumping! 最大上升子序列和)
- HDU 1087 Super Jumping!Jumping!Jumping求连续上升子序列的最大和值 (解析)
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!