HDU-1087-Super Jumping! Jumping! Jumping!(DP)
来源:互联网 发布:淘宝店铺设计公司 编辑:程序博客网 时间:2024/03/19 19:22
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34304 Accepted Submission(s): 15564
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]=max(DP[i],DP[j]+num[i])//0
#include<stdio.h>#include<algorithm>#include<iostream>#include<string.h>using namespace std;const int maxn=1005;const int INF=0x3f3f3f3f;int num[maxn];int DP[maxn];int main(){ int N; while(scanf("%d",&N)&&N) { int result=-INF; for(int i=1; i<=N; i++) { scanf("%d",&num[i]); DP[i]=num[i]; for(int j=1; j<i; j++) if(num[j]<num[i]) DP[i]=max(DP[i],DP[j]+num[i]); result=max(result,DP[i]); } printf("%d\n",result); } return 0;}
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!【dp】
- HDU-1087 Super Jumping! Jumping! Jumping! (DP)
- HDU-1087 Super Jumping! Jumping! Jumping!(DP)
- 解决,APP运行中找不到so库的问题
- java中 关于a = a++; 与 a = ++a; 的问题
- Shell脚本学习之expect命令
- 解决AndroidStudio2.2初装的几个问题
- 如何修改物料的计价方式
- HDU-1087-Super Jumping! Jumping! Jumping!(DP)
- 多行数据提交到Struts的ActionForm的List属性中
- Java_04
- 踩过的坑,都是有原因的
- 设计模式读书笔记-----建造者模式
- jQuery基础教程 · 摘要
- 存储设计思考
- Android之ContentProvider总结
- sap-差异分摊