hdu1087 DP水题
来源:互联网 发布:手机淘宝装修新品上架 编辑:程序博客网 时间:2024/04/30 20:30
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34297 Accepted Submission(s): 15559
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
dp水题,复杂度 O(n2)。
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;int a[1050];int dp[1050];int main(){ int n; while(scanf("%d",&n) && n){ for(int i = 1; i <= n; i++){ scanf("%d",&a[i]); } for(int i = 1; i <= n; i++){ dp[i] = a[i]; int maxx = 0; for(int j = i-1; j >= 1; j--){ if(a[j] < a[i]) maxx = max(dp[j],maxx); } dp[i] += maxx; } int maxx = 0; for(int i = 1; i <= n; i++) maxx = max(maxx,dp[i]); cout << maxx <<endl; }}
0 0
- hdu1087 DP水题
- HDU1087(DP)
- 单行dp复习hdu1087
- hdu1087(DP)
- neu dp b题 hdu1087
- hdu1087
- hdu1087
- HDU1087
- HDU1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- HDU1087
- hdu1087
- hdu1087
- hdu1087
- 根据User Agent参数的各个字段Mozilla/5.0/4.0-AppleWebKit/Chrome/Safari/Firefox/Opera/MSIE来确定/判断客户端使用什么浏览器
- 芒果iOS开发之CocoaPods:Pods written in Swift can only be integrated as frameworks; add `use_frameworks!`
- DOM知识总结
- Android 隐藏键盘的方法
- Oracle 12c RAC 到单机实例 DATAGUARD搭建
- hdu1087 DP水题
- 完全备份、差异备份以及增量备份的区别
- Java Web开发中路径问题小结
- JSP的编译指令
- Java中的内部类和匿名类
- 音视频同步原理及打时间戳
- apt-get install MySQL before C API
- 整理分享下自己平时工作中写的一些类库
- 99%的人都理解错了HTTP中GET与POST的区别