hdoj 1087 Super Jumping! Jumping! Jumping! 【dp&&最大递增子段和】
2016-01-10 11:12
369 查看
Total Submission(s): 29653 Accepted Submission(s): 13233
[align=left]Problem Description[/align]
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.
![](https://oscdn.geek-share.com/Uploads/Images/Content/201308/b69a36fbfe92ef60e13d861294653386.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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, print the maximum according to rules, and one line one case.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
[/code]
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
[align=left]Problem Description[/align]
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.
![](https://oscdn.geek-share.com/Uploads/Images/Content/201308/b69a36fbfe92ef60e13d861294653386.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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, print the maximum according to rules, and one line one case.
[align=left]Sample Input[/align]
3 1 3 2 4 1 2 3 4 4 3 3 2 1 0
[align=left]Sample Output[/align]
4 10 3分析:这道题实际就是求数据的最大递增子段和的问题,从1——n如果前面有比他大的数据就加上,没有就加本身。代码:[code]#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:b using 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; }
[/code]
相关文章推荐
- 银行小系统知识 头文件,函数指针菜单
- libusb学习-3
- 用ETC压缩Unity图片资源
- 用perl发送http请求
- Gevent tutorial (Gevent中文教程,Gevent中文翻译)
- 黑马.net14期21期完整无密版下载地址
- 【Beta阶段】发布说明
- usb 摄像头方案总结
- unix 环境高级编程(1)
- PHP和JS判断字符串是否为数字
- javascript 中的phototype用法
- TCP/IP illustrated 阅读笔记(二) 网络地址架构
- 上机题目(初级)-小明的筷子(Java)
- 物联网重点
- libusb学习-2
- iOS - 判断设备类型/第一响应者
- object-c所有知识点集合
- 远程桌面之防火墙无法更改设置
- Java中Spring获取bean方法小结
- 算法导论课后习题解析 第一章