HDOJ/HDU 1087 Super Jumping! Jumping! Jumping!(经典DP~)
2016-05-26 01:53
417 查看
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.
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
就是找最大的递增子序列!!!
用动态规划做~
从前往后依次计算出当前递增子序列的值~dp[i]
最后找出最大的dp[i]就是答案~~
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.
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
就是找最大的递增子序列!!!
用动态规划做~
从前往后依次计算出当前递增子序列的值~dp[i]
最后找出最大的dp[i]就是答案~~
import java.util.Scanner; /** * @author 陈浩翔 * * 2016-5-26 */ public class Main{ public static void main(String[] args) { Scanner sc =new Scanner(System.in); while(sc.hasNext()){ int n=sc.nextInt(); if(n==0){ break; } int a[]=new int ; int dp[]=new int ; for(int i=0;i<n;i++){ a[i]=sc.nextInt(); } dp[0]=a[0]; for(int i=1;i<n;i++){ int max=0; for(int j=0;j<i;j++){ if(a[j]<a[i]&&dp[j]>max){ max=dp[j]; } } dp[i]=a[i]+max; } int max=dp[0]; for(int i=1;i<n;i++){ if(dp[i]>max){ max=dp[i]; } } System.out.println(max); } } }
相关文章推荐
- Eclipse工具安装OpenExplorer插件--快速打开文档目录
- iOS开发之点触textView编辑区关闭键盘
- HashMap深度解析(二)
- 写了一个基于React+Redux的仿Github进度条
- Codeforces Round #354 (Div. 2)_Vasya and String(尺取法)
- Codeforces Round #354 (Div. 2)_Vasya and String(尺取法)
- Activity启动模式
- HashMap深度解析(一)
- webapi+entityframework分享
- jQuery基础(一)
- Struts2的convention插件,在步骤中使用Action注解跳转到其他jsp页面
- LeetCode 145. Binary Tree Postorder Traversal(二叉树后序遍历)
- 关于在写5-3路上的一点趣事
- SVG path绘制百分比圆弧,给力啊
- windows下编译java源文件的编码错误
- VMware中linux访问共享文件夹设置流程
- TortoiseSVN与VisualSVN Server搭建SVN版本控制系统【转】
- 理解几个概念
- 9.2容器库概览
- LeetCode 146. LRU Cache(LRU缓存)