Super Jumping! Jumping! Jumping! HDU - 1087(dp,上升子串求最大和)
2017-12-07 21:57
323 查看
Super Jumping! Jumping! Jumping!
HDU- 1087
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.
InputInput 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.
OutputFor 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
题意:每行第一个数为n,后面n个数,从第一个数开始到最后(可跳跃),但是必须只能按照数的上升顺序走,每走一步,sum加上这一步的值,求在路径中能获得的最大sum值。
AC代码:
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define maxn 1010
using namespace std;
int main()
{
int n,a[maxn],dp[maxn],i,j,maxdp;
while(scanf("%d",&n)!=EOF){
if(n==0)break;
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
dp[i]=a[i];
}
for(i=2;i<=n;++i){
for(j=1;j<i;++j){
if(a[i]>a[j]&&dp[i]<dp[j]+a[i]){
dp[i]=dp[j]+a[i];
}
}
}
maxdp=-1;
for(i=1;i<=n;++i){
if(dp[i]>maxdp)
maxdp=dp[i];
}
cout<<maxdp<<endl;
}
return 0;
}
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- hdu 1087 Super Jumping! Jumping! Jumping! (最大 上升子序列 线性 dp)
- hdu 1087 Super Jumping! Jumping! Jumping! 【最大上升子串和】
- HDU1087--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 最大上升子序列)
- hdu 1087 Super Jumping! Jumping! Jumping!(最长上升子序列&dp)
- HDU1087 Super Jumping! Jumping! Jumping! DP求非连续单调递增序列的最大和
- hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )
- (hdu step 3.2.3)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! (LIS 最大上升子序列)
- hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大递增子串和)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)
- HDU 1087 Super Jumping!Jumping!Jumping求连续上升子序列的最大和值 (解析)