HDU 1087 Super Jumping! Jumping! Jumping!
来源:互联网 发布:网络教育毕业证怎么拿 编辑:程序博客网 时间:2024/05/01 22:48
点击打开链接
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15733 Accepted Submission(s): 6685
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
关键是找好初始化。
#include<stdio.h>#include<string.h>int z[1007],sum[1007];int main(){ int m; while(scanf("%d",&m),m) { int i,j; for(i=1;i<=m;i++) { scanf("%d",&z[i]); } memset(sum,0,sizeof(sum)); int max=z[1]; sum[1]=z[1]; for(i=2;i<=m;i++) { sum[i]=z[i];//特别注意这个初始化 for(j=1;j<i;j++) { if((z[i]>z[j])&&(sum[i]<sum[j]+z[i])) sum[i]=sum[j]+z[i]; } if(max<sum[i]) max=sum[i]; } printf("%d\n",max); } return 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
- LR关联的例子
- 问题二十五:用结构体编写程序,求3个长方柱(Bulk)的体积和表面积。
- Apache如何添加虚拟目录
- TU 分割示意图
- android 定时
- HDU 1087 Super Jumping! Jumping! Jumping!
- BZOJ 3097(Hash Killer I-哈希%u64的不可行)
- The Prisoner of Zenda——5、His Majesty returns to Strelsau
- 黑马程序员_接口整理
- 判断一个邮箱地址是否合格
- PHP抓取页面
- 字符编解码的故事(ASCII,ANSI,Unicode,Utf-8)
- 工作任务的顺序安排
- 编程之美第1题,真心表示玩不转