HDU 1087 Super Jumping! Jumping! Jumping!
来源:互联网 发布:100本网络禁书打包下载 编辑:程序博客网 时间:2024/04/26 13:01
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31037 Accepted Submission(s): 13910
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: 1176 1159 1069 1058 1231
动态规划,,类似于求最长上升子序列
#include<stdio.h>#include<string.h>#include<algorithm>#define INF 0xfffffffusing namespace std;int dp[110000],a[110000];int main(){int n,i,j,k,l,m,ans;while(scanf("%d",&n),n){memset(dp,0,sizeof(dp));for(i=1;i<=n;i++)scanf("%d",&a[i]);for(i=1;i<=n;i++){ans=-INF;for(j=0;j<i;j++){if(a[i]>a[j]){ans=max(ans,dp[j]);}}dp[i]=ans+a[i];}ans=-INF;for(i=0;i<=n;i++){if(dp[i]>ans)ans=dp[i];}printf("%d\n",ans);}return 0;}
0 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
- 如何用maya 渲染论文彩图 (occulusion效果)
- 基本数据类型:8种基本类型、对应的包装类、引用数据类型及与String 之间的转换。
- lightoj 1169 - Monkeys on Twin Tower 简单DP
- JSP程序设计:Servlet配置问题
- 买衣服
- HDU 1087 Super Jumping! Jumping! Jumping!
- vmware unlock 无法成功 LookupError: unknown encoding: cp65001
- 大锅乱炖10大H5前端框架
- 修改Odoo8.0列表表尾数值统计方式
- 基于AndFix的热修复 成功后简单的总结总结错失
- SOA与微服务的区别
- Android中FastJson解析json1
- 大话数据结构读书笔记系列(五)串
- jquery之抛物线式购物车