HDU 1087 Super Jumping! Jumping! Jumping!
2015-07-29 15:37
429 查看
Super Jumping! Jumping! Jumping!
[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.
![](http://acm.hdu.edu.cn/data/images/1087-1.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
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { long long dp[1005]; long long ans; int v[1005]; int n,i,j; while(scanf("%d",&n)&&n) { ans=0; memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) scanf("%d",&v[i]); for(i=0;i<n;i++) { dp[i]=v[i]; for(j=0;j<i;j++) if(v[j]<v[i]) dp[i]=max(dp[i],dp[j]+(long long)v[i]); ans=max(ans,dp[i]); } printf("%lld\n",ans); } }
相关文章推荐
- Run time setting设置详解
- java环境配置
- c++ primer 学习笔记-第三章
- GCC 4.8编译程序抛出Error: no such instruction: `某某汇编指令`
- openfire内存问题解决方法汇总
- 关于三级指针
- 单调递增最长子序列
- H. 264 算法特点
- 《C/C++/Java/Pascal 程序设计基础》习题集 解题2
- ubuntu下dnw2工具的使用
- AngularStrap -- Modal
- poj 2240 Arbitrage(Bellman-Ford||Floyd)(中等)
- Java HashMap初探
- H. 264/ AVC 新一代视频编解码标准
- Android实例-多窗口的切换(XE8+小米2)
- 图标素材网站收集
- android该怎么办iphone那种画面抖动的动画效果(含有button和EditText)
- 安卓中定时器和线程的使用
- jQuery插件开发模式
- 骨牌覆盖