Super Jumping! Jumping! Jumping! 最长上升子序列+DP

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

最长子序列的同款题目，这次求的不是最长子序列的长度，而是最长子序列的和，只需要把最长子序列模板的值做一下修改，一般情况下dp数组的值是在自己之前的最长子序列的长度，这里换为在自己之前的最长子序列的和即可。

AC代码

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int dp[1005];
int num[1005];
int main()
{int n;while(cin>>n&&n){int maxl=-1;memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++)cin>>num[i];for(int i=1;i<=n;i++){for(int j=1;j<i;j++)if(num[i]>num[j])dp[i]=max(dp[i],dp[j]+num[i]);if(dp[i]==0) dp[i]=num[i];if(maxl<dp[i]) maxl=dp[i];}cout<<maxl<<endl;}return 0;
}

Super Jumping! Jumping! Jumping! 最长上升子序列+DP相关推荐

HDU1087 Super Jumping! Jumping! Jumping!【最长上升子序列+DP】
问题链接:HDU1087 Super Jumping! Jumping! Jumping!. 问题简述:参见上述问题描述. 问题分析: 这是一个最长上升子序列问题,使用DP算法实现. 定义dp[i]= ...
Bailian2806 公共子序列【最长公共子序列+DP】
2806:公共子序列描述我们称序列Z = < z1, z2, -, zk >是序列X = < x1, x2, -, xm >的子序列当且仅当存在严格上升的序列< ...
NUC1776 Tiling Up Blocks【二维最长上升子序列+DP】
Tiling Up Blocks 时间限制: 1000ms 内存限制: 10000KB 通过次数: 2总提交次数: 2 问题描述 Michael The Kid receives an interes ...
Vijos P1571 笨笨的导弹攻击【最长上升子序列+DP】
背景在那遥远的地方,有个小目标-- 笨笨:导弹准备! 路人甲:(这么小个目标都要欺负--)老大,导弹只有一部分可以用-- 笨笨:不管那么多,有多少就打多少! 描述为了彻底打击目标,笨笨要使用足够多 ...
Vijos P1303 导弹拦截【最长上升子序列+DP】
背景实中编程者联盟为了培养技术精湛的后备人才,必须从基础题开始训练. 描述某国为了防御敌国的导弹袭击,研发出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度, ...
HDU1257 最少拦截系统【最长上升子序列+DP】
问题链接:HDU1257 最少拦截系统. 问题简述:参见上述问题描述. 问题分析:这个问题的本质是求最长上升子序列.与<POJ2533 Longest Ordered Subsequence[最 ...
NYOJ 36 最长公共子序列 dp
最长公共子序列点击打开链接时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述咱们就不拐弯抹角了,如题,需要你做的就是写一个程序,得出最长公共子序列. tip:最长公共子序 ...
LeetCode 1035. 不相交的线（最长公共子序列DP）
文章目录 1. 题目 2. 解题 1. 题目我们在两条独立的水平线上按给定的顺序写下 A 和 B 中的整数. 现在,我们可以绘制一些连接两个数字 A[i] 和 B[j] 的直线,只要 A[i] == ...
51nod1134最长递增子序列(dp)
题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1134 这里说下,最长上升子序列和最长不降子序列几乎一样,只是判 ...
Bailian2945 导弹拦截【最长上升子序列+DP】
2945:拦截导弹总时间限制: 1000ms 内存限制: 65536kB 描述某国为了防御敌国的导弹袭击,开发出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高 ...

Super Jumping! Jumping! Jumping! 最长上升子序列+DP

Super Jumping! Jumping! Jumping! 最长上升子序列+DP相关推荐

最新文章

热门文章