hdoj 1087Super Jumping! Jumping! Jumping!《《dp》》
2016-03-29 11:21
405 查看
K - dp
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
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,动态规划
代码:
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
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,动态规划
代码:
#include<cstdio> #include<algorithm> using namespace std; #define MA 1005 int n; long long s[MA]; int shu[MA]; int main() { while (scanf("%d",&n),n) { for (int i=1;i<=n;i++) scanf("%d",&shu[i]); s[1]=shu[1]; for (int i=1;i<=n;i++) { s[i]=shu[i]; for (int j=1;j<i;j++) { if (shu[i]>shu[j]&&s[i]<s[j]+shu[i]) s[i]=s[j]+shu[i]; } } sort(s+1,s+n+1); printf("%lld\n",s ); } return 0; }
相关文章推荐
- mac配置android和maven环境变量
- PHP程序员最常犯的11个MySQL错误
- JavaEE的13种核心技术
- Mysql导入官方示例employees问题解决记录
- Ubuntu上的ftp配置连接
- 【BZOJ2435】[Noi2011]道路修建【TreeDP】
- 次小生成树
- 【多题合集】KMP练习
- Opengl坐标系 坐标变换 笔记
- Hibernate 注解和配置文件两种方法的对比(有实例)
- 模块管理常规功能自己定义系统的设计与实现(52--功能更新[2] 对百分比字段的操作)
- Jgroups环境检测
- 用Winrar批量解压缩有密码文件方法,只需输入一次密码
- 2016年3月28日作业 沟通和合同管理
- StringBuffer跟StringBuilder的区别
- linux内核串口控制器注册以及收发
- 【bzoj1565】【NOI2009】【植物大战僵尸】【拓扑排序+最小割】
- Android 中Webview 自适应屏幕
- leetcode 91. Decode Ways
- win7各种无法上网的解决办法