Super Jumping! Jumping! Jumping!
来源:互联网 发布:linux编程入门 编辑:程序博客网 时间:2024/05/19 11:45
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37159 Accepted Submission(s): 16982
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/*就是求上升子序列的最大和,,,思路是对的,初始化dp 数组写错地方,瞬间傻眼了*/#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int a[1020];int dp[1020];int n;int find(){int maxx=INT_MIN; for(int i=1;i<=n;i++){for( int j=1;j<=i-1;j++){if(a[i]>a[j]&&dp[j]+a[i]>dp[i]){dp[i]=dp[j]+a[i];}}if(dp[i]>maxx)maxx=dp[i];}return maxx;}int main(){while(scanf("%d",&n)){if(n==0)break;memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){scanf("%d",&a[i]);dp[i]=a[i];}if(find()==0)printf("-1\n");elseprintf("%d\n",find());} }
0 0
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- .htaccess 详解
- hdu 6000 Wash(2016 CCPC-Final)
- SparkGraphX加权最短路径算法实现
- CSS3的边框
- Fire Game
- Super Jumping! Jumping! Jumping!
- Atcoder Grand Contest 013D
- IOS之OC点语法和变量作用域
- matplotlib绘图实例:pyplot、pylab模块及作图参数
- 公司项目的进度
- Oracle SQL忽略大小写模糊查询
- 剑指offer 字符串左旋
- 关于sizeof和strlen的一些用法
- ZOJ2208 To and Fro