hdoj 1087 Super Jumping! Jumping! Jumping! 【dp&&最大递增子段和】
来源:互联网 发布:送货派单软件 编辑:程序博客网 时间:2024/06/05 19:34
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29653 Accepted Submission(s): 13233
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分析:这道题实际就是求数据的最大递增子段和的问题,从1——n如果前面有比他大的数据就加上,没有就加本身。代码:#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<queue>#define mem(x,y) memset(x,y,sizeof(x))#define SI(x) scanf("%d",&x)#define O_O(x) while(x--)#define max(a,b) a>b?a:busing namespace std;const int inf=0x3f3f3f3f;const int maxn=1010;int pp[maxn],dp[maxn];int main(){int n,ans;while(SI(n)!=EOF,n){int i,j;mem(dp,0);for( i=1;i<=n;i++)SI(pp[i]);for(i=1;i<=n;i++){ans=-inf;for( j=0;j<i;j++){if(pp[i]>pp[j])ans=max(ans,dp[j]);}dp[i]=ans+pp[i];}ans=-inf;for( i=0;i<=n;i++){if(dp[i]>ans)ans=dp[i];}printf("%d\n",ans);}return 0;}
0 0
- hdoj 1087 Super Jumping! Jumping! Jumping! 【dp&&最大递增子段和】
- 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!(动态规划,最大递增子段和)
- hdu1087 - Super Jumping! Jumping! Jumping! (dp 求递增子序列的最大和)
- 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】
- 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 1080-Super Jumping! Jumping! Jumping!(LIS最长上升子序列-最大递增子段和)
- hdu 1087 Super Jumping! Jumping! Jumping!(基础DP,最大上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- unix 环境高级编程(1)
- 银行小系统知识 头文件,函数指针菜单
- 用perl发送http请求
- libusb学习-3
- Gevent tutorial (Gevent中文教程,Gevent中文翻译)
- hdoj 1087 Super Jumping! Jumping! Jumping! 【dp&&最大递增子段和】
- libusb学习-4
- Harry Potter's Exam
- 计算机基础知识-一级缓存与二级缓存,堆栈
- OpenStreetMap学习(一)
- SKSpriteKit 2-Physics and Collision
- nodejs摘要
- From movement tracks through events to places: Extracting and characterizing significant places from
- libusb学习-5