HDU 1087--Super Jumping! Jumping! Jumping!【最长递增子序列的和】
来源:互联网 发布:java讲师招聘 编辑:程序博客网 时间:2024/06/07 17:52
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25474 Accepted Submission(s): 11250
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 <algorithm>#include <cstring>#include <cstdio>#define maxn 10010using namespace std;int dp[maxn];//dp为能够到达当前这个位置时的最大值int a[maxn];int main (){int n;while(scanf("%d", &n), n){int i,j;int sum,num;for(i = 1; i <= n; ++i)scanf("%d", &a[i]);memset(dp,0,sizeof(dp));num=dp[1]=a[1];for(i = 2; i <= n; ++i){dp[i] = a[i];for(j = i-1; j>=1 ;--j){if(a[i] > a[j]) dp[i] = max(dp[i], dp[j]+a[i]); }num = max(num, dp[i]);}printf("%d\n", num);}return 0;}
0 0
- HDU 1087--Super Jumping! Jumping! Jumping!【最长递增子序列的和】
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- HDU 1087 Super Jumping! Jumping! Jumping!(求绝对递增子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
- hdu 1087 Super Jumping! Jumping! Jumping! (最大递增子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!-dp 最长上升子序列和
- hdu 1087 Super Jumping! Jumping! Jumping! 最长上升子序列的变形
- HDU 1080-Super Jumping! Jumping! Jumping!(LIS最长上升子序列-最大递增子段和)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大的上升子序列的和)(不是最长)(易混淆)
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping! 最大子序列的和
- HDU 1087 Super Jumping!Jumping!Jumping求连续上升子序列的最大和值 (解析)
- HDU 1087 Super Jumping! Jumping! Jumping![动态规划——最大递增子序列]
- hdu1087 - Super Jumping! Jumping! Jumping! (dp 求递增子序列的最大和)
- hdu 1087 Super Jumping! Jumping! Jumping!(最长上升子序列变形)
- Android手机内存管理与性能优化视频教程
- Cocos 2015开发者大会:陈昊芝与王哲联手推荐手游录像SDK—WeRec
- OpenStack 网络:Neutron 初探
- unix中configure命令
- 利用JQuery+EasyDrag 实现弹出可拖动的Div,同时向Div传值,然后返回Div选中
- HDU 1087--Super Jumping! Jumping! Jumping!【最长递增子序列的和】
- IT运维服务体系建设思路
- Http Header
- csapp:lab2
- Leetcode题目分类:类型+难易
- Android 自定义View可拖动移动位置及边缘拉伸放大缩小 - Livingstone
- android volley 使用
- centos6.5源码安装mysql5.5.37
- Rational Rose与UML教程