hdu 1087 Super Jumping! Jumping! Jumping! 【最大上升子串和】
来源:互联网 发布:网络打印机的安装 编辑:程序博客网 时间:2024/06/06 01:13
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22437 Accepted Submission(s): 9868
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
/*
题目大意:找出和最大的上升序列:例如:5 6 4 2 6 9这一段的最大的上升序列和为:20(5 6 9)
题解:
每次做DP新问题都有收获,但自己想总是想不到 ,参考讨论区后,就一下明了。
这一点,真让人头疼...这个题的动态转换方程式是:
dp[i] = max(dp[j]+dp[i],dp[i]);
*/
#include<cstdio>#include<cstring>#include<iostream>using namespace std; int dp[1010],a[1010];int main(){ int n,i,j,sum; while(scanf("%d",&n)&&n) { memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); for(i=0; i<n; i++) { scanf("%d",&a[i]); dp[i]=a[i]; } for(i=0,sum=0; i<n; i++) { for(j=0; j<i; j++) { if(a[j]<a[i]) { dp[i]=max(dp[j]+a[i],dp[i]); } } if(sum<dp[i]) sum=dp[i]; } printf("%d\n",sum); } return 0;}
0 0
- 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!(基础DP,最大上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- 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 上升子序列最大和)
- hduoj Super Jumping! Jumping! Jumping!【最大上升子序列和】
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- HDU 1087 Super Jumping! Jumping! Jumping!(最大递增子串和)
- HDU 1087.Super Jumping! Jumping! Jumping!【最大上升子序列和】【1月2】
- hdu 1087 Super Jumping! Jumping! Jumping! 最大上升子序列。模板题
- HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)
- python3.x和python2.x的区别
- c语言 int 有无符号的min max值
- Java socket 编程
- Permutations II (重重重)
- Java线程池应用
- hdu 1087 Super Jumping! Jumping! Jumping! 【最大上升子串和】
- iOS 图像处理 - 图像拼接
- C/C++产生随机数
- JQuery中.AddClass()和.RemoveClass()
- 思维逻辑面试题
- C语言其实不简单:sizeof
- java socket 编程(一)
- hdu2112HDU Today trie+map
- 自己动手写CPU之第七阶段(3)——简单算术操作指令实现过程(续)