HDU 1087 Super Jumping! Jumping! Jumping!
来源:互联网 发布:淘宝多久自动好评 编辑:程序博客网 时间:2024/05/16 04:02
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41266 Accepted Submission(s): 19118
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
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1058 1231 1421 2571 1024
算是动态规划题目吧,不过我觉得 更像暴力,去暴力下就可以,一切尽在代码中
ac代码
#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>using namespace std;int n,a[1010],dp[1010];int main(){while(~scanf("%d",&n)){if(n==0)break ;for(int i=1;i<=n;i++){scanf("%d",&a[i]);}memset(dp,0,sizeof(dp));dp[1]=a[1];for(int i=2;i<=n;i++){for(int j=1;j<i;j++){if(a[i] > a[j])dp[i]=max(dp[i],dp[j]+a[i]);elsedp[i]=max(dp[i],a[i]);}} int max1=dp[1];for(int i=2;i<=n;i++)max1=max(max1,dp[i]);printf("%d\n",max1);}return 0;}
阅读全文
1 0
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 - Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 Super Jumping! Jumping! Jumping!
- hdu - 1087 - Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- 腾讯 百度 高德 Google 地图导航 实现
- Altium Designer如何设置元件自动编号解决编号冲突
- vi 小技巧
- Android面试——Service相关
- Nuttx启动过程
- HDU 1087 Super Jumping! Jumping! Jumping!
- 挑战程序竞赛系列(50):4.2 推理与动态规划算法(3)
- 惠威T200B刷机 Q群
- 自我介绍与博客规划-第一篇文章
- 百度地图集成及基本定位
- spring工作原理
- 解决用Hexo和GitHub搭建博客时hexo d命令报错问题
- What is Regression?
- 轻松搞定文本公式的计算