hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
来源:互联网 发布:移动网络电视信号不好 编辑:程序博客网 时间:2024/06/02 06:21
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25805 Accepted Submission(s): 11416
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
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
简单的dp:
#include <stdio.h>#include <cstring>int main(){int n;while(scanf("%d",&n)!=EOF&&n){int num[1010];int sum[1010];memset(num,0,sizeof(num));memset(sum,0,sizeof(sum));for(int i=0;i<n;i++){scanf("%d",&num[i]);sum[i]=num[i];//另开一个数组记录当前位置的最大递增和。}int max=sum[0];for(int i=1;i<n;i++){for(int j=0;j<i;j++){if(num[i]>num[j]&&sum[i]<sum[j]+num[i])//如果这个数比前面的某个数(num【j】)大, //并且,当前最大递增和(sum【i】)小于该位置的值(num【i】)加上前面的某个数的sum(sum【j】){sum[i]=sum[j]+num[i]; // 就替换sum【i】}if(sum[i]>max)max=sum[i];}}printf("%d\n",max);}return 0;}
0 0
- hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
- [简单DP]Super Jumping! Jumping! Jumping! HDU
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!【dp】
- 【cocos2d-x 3.5】C++物理引擎
- ListView滑动删除 ,仿腾讯QQ
- Android整理:SQlite数据库的使用以及通过listView显示数据
- Myeclipse +eclipse设置+快捷键
- 12 POJ1477 Box of Bricks
- hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
- Android之SimpleAdapter简单实例和SimpleAdapter参数说明
- MFC学习二
- python面对对象
- 13 URAL1303 Minimal Coverage
- C#学习第八天 值类型和引用类型、字符串类String
- java基础入门-父类引用子类对象(2)-抽象类
- 欧几里得算法
- hdu 1495