杭电-Super Jumping! Jumping! Jumping!（LIS）

r囧r小猫 2022-08-10 00:42 139阅读 0赞

# Super Jumping! Jumping! Jumping! #

**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)**

Total Submission(s): 28900 Accepted Submission(s): 12910

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.  
  
![1087-1.jpg][]  
  
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<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	int m,n,a[1010],dp[1010],i,j;
    	while(scanf("%d",&m),m)
    	{
    		for(i=0;i<m;i++)
    		scanf("%d",&a[i]);
    		int max=0; 
    		for(i=0;i<m;i++)
    		{
    			dp[i]=a[i];
    			if(dp[i]>max)
    			max=dp[i];
    			for(j=0;j<i;j++)
    			{
    				if(a[j]<a[i]&&dp[j]+a[i]>dp[i])
    				dp[i]=dp[j]+a[i];
    			}
    			if(dp[i]>max)
    			max=dp[i];
    		}
    		printf("%d\n",max);
    	}
    	return 0;
     }

动态转移方程：

dp\[i\]=max(dp\[j\]+a\[i\],a\[i\])

我理解的就是dp\[i\]意义是：已a\[i\]结尾的最长上升子序列的最大和（不知道对不对）

[1087-1.jpg]: /images/20220731/be46addb54f240fc97f1db5f7cb20099.png