HDU-1087(Super Jumping! Jumping! Jumping!)
2015-10-25 20:33
225 查看
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题,求最长递增子序列,dp[i]表示到第i个数的最优值,
首先要想到DP的性质:最优子结构,即全局最优解的局部也是最优解;
主要思路是后边每一步要根据前边已求的最优解推出;
状态转移方程:dp[i]=max{dp[j]+a[i],dp[i]}(前提是a[i]>a[j]),意思是如果第i个数比第j个数大,就可以直接从第i个数跳到第j个数,
判断到第j个数时的最优解加上第i个数是否比当前到第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题,求最长递增子序列,dp[i]表示到第i个数的最优值,
首先要想到DP的性质:最优子结构,即全局最优解的局部也是最优解;
主要思路是后边每一步要根据前边已求的最优解推出;
状态转移方程:dp[i]=max{dp[j]+a[i],dp[i]}(前提是a[i]>a[j]),意思是如果第i个数比第j个数大,就可以直接从第i个数跳到第j个数,
判断到第j个数时的最优解加上第i个数是否比当前到第i个数时的最优解大;
#include<stdio.h> int max (int a,int b) { return a>b?a:b; } int main () { int a[1005],dp[1005]; int i,j,n; int sum; while (scanf ("%d",&n),n) { for (i=0;i<n;i++) { scanf ("%d",&a[i]); } dp[0]=a[0]; sum=dp[0]; for (i=1;i<n;i++) { dp[i]=a[i]; for (j=0;j<i;j++) { if (a[i]>a[j]) dp[i]=max(dp[j]+a[i],dp[i]); } if (dp[i]>sum) sum=dp[i]; } printf ("%d\n",sum); } return 0; }
相关文章推荐
- Python基础(二) Python常用变量
- joe_chang
- HDU 3262 Seat taking up is tough
- Hadoop 中的 Combiner 过程
- 一道随机函数题:由rand5()生成rand7()
- 【Hibernate集锦】---继承映射之单表继承
- E哥的Git教程(一)热身篇
- Python基础(一) Hello World
- Spring MVC常用的注解
- jQuery Raion, Select, CheckBox selector function
- 【FastDev4Android框架开发】Android 数据缓存器ACache的详解和使用(四)
- IO输入输出流
- Daily Scrumming* 2015.10.24(Day 5)
- 关于指针
- 基于Theano的深度学习(Deep Learning)框架Keras学习随笔-17-Embedding Layers
- R12.1.3 应用克隆过程中autocfg脚本报错
- 月薪3万的程序员都避开了哪些坑
- Unix / 类 Unix shell 中有哪些很酷很冷门很少用很有用的命令?(转)
- src href
- 视频框架 Vitamio 使用教程+部分心得 (三) 视频控制器MediaController + 部分中文API