HDU1087-Super Jumping! Jumping! Jumping!
来源:互联网 发布:哪个软件有汉仪丫丫体 编辑:程序博客网 时间:2024/04/30 21:37
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31939 Accepted Submission(s): 14365
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
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int n;int a[1009],dp[1009];int x;int main(){ int i,j; while(~scanf("%d",&n)) { if(n==0) break; for(i=1;i<=n;i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); a[0]=0; for(i=1;i<=n;i++) { x=-1; for(j=0;j<i;j++) { if(a[i]>a[j]) x=max(dp[j],x); } dp[i]=a[i]+x; } x=-1; for(i=1;i<=n;i++) { if(dp[i]>x) x=dp[i]; } printf("%d\n",x); } return 0;}
0 0
- Super Jumping! Jumping! Jumping!(HDU1087)
- hdu1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087--Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!(HDU1087)
- hdu1087-Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087----Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu1087---Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- 【HDU1087】【Super Jumping! Jumping! Jumping!】
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087----Super Jumping! Jumping! Jumping!
- 快速删除Mongo
- RabbitMQ的安装
- 第23条 泛型——请不要在新代码中使用原生态类型
- objective-C之NSData
- HDOJ1874
- HDU1087-Super Jumping! Jumping! Jumping!
- Java 程序员们值得一看的好书推荐
- nutz的框架NutzDao自定义SQL
- 利用java反射调用类及父类的的私有方法
- 第13届浙江省赛D题POJ3939
- 小何讲Linux: Linux中文件及文件描述符概述
- Java 关键字作用备忘
- PMP认证仅是基础,易迪思项目管理学院八大实战课程为您服务
- npm使用介绍