HDU 1087(动态规划-最大上升序列)
2017-10-27 09:36
337 查看
问题描述:
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.
![](https://odzkskevi.qnssl.com/b69a36fbfe92ef60e13d861294653386?v=1509013702)
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
Sample Output
题目题意:让我们求出最大上升序列的值。
和最长上升子序列差不多。
代码如下:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1e3+100;
int a[maxn],dp[maxn];
int main()
{
int n;
while (scanf("%d",&n)!=EOF) {
if (n==0) break;
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
int ans=0;
for (int i=0;i<n;i++) {
dp[i]=a[i];
for (int j=0;j<i;j++) {
if (a[j]<a[i])
dp[i]=max(dp[i],dp[j]+a[i]);
}
ans=max(ans,dp[i]);
}
printf("%d\n",ans);
}
return 0;
}
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
题目题意:让我们求出最大上升序列的值。
和最长上升子序列差不多。
代码如下:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1e3+100;
int a[maxn],dp[maxn];
int main()
{
int n;
while (scanf("%d",&n)!=EOF) {
if (n==0) break;
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
int ans=0;
for (int i=0;i<n;i++) {
dp[i]=a[i];
for (int j=0;j<i;j++) {
if (a[j]<a[i])
dp[i]=max(dp[i],dp[j]+a[i]);
}
ans=max(ans,dp[i]);
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- hdu 1087 上升子序列最大和
- HDU 1087 Super Jumping! Jumping! Jumping![动态规划——最大递增子序列]
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)
- HDU1087 / SDNU1330 求上升序列最大和
- hdu 1087 (最大上升子序列和)动态规划
- 【HDU 1087】Super Jumping! Jumping! Jumping!(最大上升子序列和,动态规划)
- Super Jumping! Jumping! Jumping! 【hdu-1087】【动态规划-最长上升子序列】
- hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )
- HDU 1087 最大上升子序列的和
- hdu 1087 最大上升子序列的和(dp或线段树)
- HDU-1087 Super Jumping! Jumping! Jumping! (线性dp 上升子序列最大和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- hdu 1087最大上升子序列的和
- HDU 1087(最大上升子序列+动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping! (求最大上升子序列和,动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
- hdu 1231最大连续子序列 (动态规划)
- ECNU2958最大上升子序列(动态规划)
- HDU 1087 最大子序列和
- HDU-1087 Super Jumping! Jumping! Jumping!(上升子序列最大和)