hdu 1087 (dp)
来源:互联网 发布:淘宝seo搜索优化 编辑:程序博客网 时间:2024/06/05 21:08
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40717 Accepted Submission(s): 18848
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.
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
题解:假设dp[i]表示跳到第i个数时的最大值,则
dp[i] = max(dp[j] | 0 <= j < i&&a[i]>a[j])+a[i];
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;const int N=(int)1e5+10;int a[N],dp[N];int main() { int n; while(~scanf("%d",&n)){ memset(dp,0,sizeof(dp)); if(n==0){ break; } for(int i=1;i<=n;i++){ scanf("%d",a+i); } dp[1]=a[1]; for(int i=2;i<=n;i++){ int M=0; for(int j=1;j<i;j++){ if(a[i]>a[j]){ M=max(M,dp[j]); } } dp[i]=M+a[i]; } int Max=0; for(int i=1;i<=n;i++){ Max=max(Max,dp[i]); } printf("%d\n",Max); } return 0;}
- HDU 1087(DP)
- HDU 1087 简单DP
- hdu 1087 dp
- hdu 1087 枚举+DP
- hdu 1087 简单dp
- hdu 1087dp
- hdu 1087 简单dp
- HDU 1087 DP
- 【DP】HDU 1087
- hdu 1087 (dp)
- hdu 1087 DP简单题
- HDU 1087--DP--(水)
- HDU DP
- DP? HDU
- DP? HDU
- DP? HDU
- 【dp】HDU
- 【dp】HDU
- 有关oracle的杂记
- support vector machine简介
- sbt构建Scala项目_helloworld
- [编程题] 交错01串
- STAR法则
- hdu 1087 (dp)
- VCG文档
- 小白学tkinter(Toplevel组件(顶级窗口),用于弹窗)
- Android 画笔演示功能的实现
- Android recyclerView实现商品规格选择
- 国际化程序
- NDK LOG 输出
- Java面向对象编程之多态(polymorphism)
- oninput、onchange与onpropertychange事件的用法和区别