HDU1087 Super Jumping! Jumping! Jumping!

                                            Super Jumping! Jumping! Jumping!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17279    Accepted Submission(s): 7392

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.

 

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
   
   
   
   

 

Author

lcy


解题思路：本题是求最长递增子序列，用动态规划。

比如arr={1,5,8,2,3,4}的最长递增子序列是1,2,3,4

动态规划的思想，考虑{arr[0],...,arr[i]}的最长递增子序列时需要找到所有比arr[i]小的arr[j]，且j<i，结果应该是所有{arr[0],...,arr[j]}的最长递增子序列中最长的那一个再加1。即我们需要一个辅助的数组aid_arr，aid_arr[i]的值是{arr[0],...,arr[i]}的最长递增子序列的长度，aid_arr[0]=1。

#include<cstdio> #include<cstdio> #include<algorithm> using namespace std; int main() {     int n,i,j;     int a[1000];     int b[1000];     while(scanf("%d",&n)&&n)     {         for(i=0;i<n;i++)             scanf("%d",&a[i]);         for(i=0;i<n;i++)         {             int max1=0;             b[i]=a[i];             for(j=0;j<i;j++)    //求当前元素前面所有比他小的元素的最长子序列最的的和                  if(a[j]<a[i])                     if(b[j]>max1)                         max1=b[j];             b[i]+=max1;         }         sort(b,b+n);         printf("%d\n",b[n-1]);     }     return 0; }