动态规划 杭电 1087
来源:互联网 发布:渣优化 编辑:程序博客网 时间:2024/05/23 15:48
刚把纠结了一上午的一道DP题写出来,这次终于碰到个软柿子,一次水过,,水题。题目:
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10323 Accepted Submission(s): 4252
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
#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){//freopen("4.txt","r",stdin); int n,num[1005],dp[1005]; while(scanf("%d",&n)&&n){ for(int i=1;i<=n;++i)scanf("%d",&num[i]);memset(dp,0,sizeof(dp));dp[1]=num[1];int xmax;for(int i=2;i<=n;++i){xmax=0;for(int j=1;j<i;++j){if(num[j]<num[i]){ if(dp[j]>xmax) xmax=dp[j];}}if(xmax==0)dp[i]=num[i];elsedp[i]=xmax+num[i];}xmax=0;for(int i=1;i<=n;++i)if(xmax<dp[i])xmax=dp[i];printf("%d\n",xmax); } return 0;}
- 动态规划 杭电 1087
- 杭电动态规划
- 杭电动态规划
- 杭电动态规划习题
- 杭电动态规划习题
- 动态规划 杭电2571
- 动态规划 杭电1231
- 动态规划 杭电1069
- 动态规划 杭电1176
- 动态规划 杭电1257
- 杭电 2881 动态规划
- 杭电 1505 动态规划
- 杭电ACM1203(动态规划)
- 杭电1176 动态规划
- 杭电动态规划题
- 杭电problem1003-动态规划
- 动态规划—杭电1087 Super Jumping! Jumping! Jumping!
- 杭电 2870 经典的动态规划
- UE常用快捷键(工欲善其事,必先利其器啊)!!
- 了解Oracle RAC Brain Split Resolution集群脑裂协议
- Derby数据库使用手册(1)-----------DDL
- Python基础知识(七)--字符串详解
- <PhysicallyBasedRendering>chap8 REFLECTION MODELS
- 动态规划 杭电 1087
- linux-更改root密码 (三种方法)
- QT VS2008开发环境
- 2012年的几个任务
- 网络的经济基础篇-之三-AH、ESP
- Linux下修改SHELL字体背景颜色笔记
- FCFS,高优先权算法进程调度程序模拟
- HDU-2255 奔小康赚大钱
- 我的2011