hdu 1087 Super Jumping! Jumping! Jumping! dp
2016-04-13 15:53
441 查看
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31488 Accepted Submission(s): 14144
[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.
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
[align=left]Author[/align]
lcy
[align=left]Recommend[/align]
ACcode:
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 100100
using namespace std;
int dp[maxn],a[maxn];
int main(){
int n,ans;
while(scanf("%d",&n),n){
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;++i)scanf("%d",&a[i]);
ans=-999;
for(int i=1;i<=n;++i){
dp[i]=a[i];
for(int j=1;j<i;++j)
if(a[i]>a[j])
dp[i]=max(dp[i],dp[j]+a[i]);
ans=ans>dp[i]?ans:dp[i];
}
printf("%d\n",ans);
}
return 0;
}
/*
3 1 3 2
4 1 2 3 4
4 3 3 2 1
0
*/
相关文章推荐
- Android使用Glide库小技巧
- SSLSplit实现中间人攻击
- 程序员的“非程序员”之路
- 基本类型和引用类型,执行环境和作用域 7fe0
- html里name和id的区别
- 不同内核浏览器的差异
- nyoj1239(最小生成树)
- lightoj 1148 - Mad Counting 简单数学
- The Pilots Brothers' refrigerator
- 稀疏矩阵的压缩存储
- NDK在eclipse下的配置及错误解决
- Android动画之旅一开篇动画简介
- git 使用(ssh key创建和github使用)
- HDU 2639 Bone Collector II(01背包、第k优解)
- ListView中的CheckBox全选反选
- hdu 2993 & POJ 2018 MAX Average Problem(斜率dp)
- 实习日志-php-分别用print_r,var_dump,var_export打印数组
- 想从微博引流量?这样做,效果杠杠滴!
- 《UML for Java Programmers》读书笔记——第二章
- 数据库架构的演变