hdu 1087 Super Jumping! Jumping! Jumping!
2016-05-11 09:11
302 查看
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32069 Accepted Submission(s): 14436
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.
![](http://acm.hdu.edu.cn/data/images/1087-1.jpg)
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.
Output
For each case, print the maximum according to rules, and one line one case.
Sample Input
3 1 3 2 4 1 2 3 4 4 3 3 2 1 0
Sample Output
4 10 3
Author
lcy
#include <stdio.h> #include <string.h> int main() { int i,s[1000],a[1000],n,j; while(scanf("%d",&n)&&n) { memset(s,0,sizeof(s)); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) { int flag=0; for(j=i-1;j>=0;j--) if(a[i]>a[j]&&flag<s[j]) flag=s[j]; //比较和的大小 s[i]=a[i]+flag; //加上a[i]之前比a[i]小的值其中之一的最大和 } int Max=s[0]; for(i=1;i<n;i++) if(Max<s[i]) Max=s[i]; printf("%d\n",Max); } return 0; }
相关文章推荐
- windows自带杀毒防火墙
- Extjs4.0 ComboBox如何实现三级联动
- JENKINS搭建
- iOS网络连接优化
- Yale CAS 安装配置过程指导书
- 把手机当网卡使用
- (总结)密码破解之王:Ophcrack彩虹表(Rainbow Tables)原理详解(附:120G彩虹表下载)
- Andrdoid中对应用程序的行为拦截实现方式之----从Java层进行拦截
- 每天laravel-20160804| Container -7
- 机器学习之逻辑回归
- pthread_barrier_init,pthread_barrier_wait简介
- 把手机当网卡使用
- jquery+php实现赞,踩功能
- please verify the preference field with the prompt:null
- 2016年Linux学习决心书(老男孩教育在线课程班第二期)
- Scala学习笔记-伴生对象于孤立对象
- IDEA设置Java类注释
- Andrdoid中对应用程序的行为拦截实现方式之----从底层C进行拦截
- muSnoitanibmoC.39
- 表单中Readonly和Disabled的区别