HDU 1087 Super Jumping! Jumping! Jumping!

首先说一下，一开始没读懂题目啊，之前做过的一道题目有点类似，影响了理解题意啊、、、

题目的大意就是：给你N个棋子，每个人可以移动棋子，但是棋子移动的时候要注意：1，每个棋子只能向后移动不能向前移动：2，每个棋子移动到的下一个棋子必须比之前的大；3，每个棋子移动的范围是不确定的可以无限的移动。

所以解题的思路就是：从1到N枚举所有的棋子，在它的后面找到比它大的数字，然后状态转移方程是：dp[j] = max{dp[j] , dp[i] + f[j]} dp[j]代表后面比前面大的数字，他的取值可以是由第i步跨过来，也可以是它原来的数值。就是当前的状态可以由之前的状态改变而来，也可以保持自己原来的状态。

Super Jumping! Jumping! Jumping!

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

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
  
  
  
  


  
  

#include <stdio.h>
#include <iostream>
#include <string.h>

using namespace std;

int dp[10100], f[10100];
int main()
{
    int i, j, n, _max;
    while(~scanf("%d",&n) && n)
    {
        memset(dp , 0 , sizeof(dp));
        for(i = 1; i <= n; i++)
        {
            scanf("%d",&f[i]);
            dp[i] = f[i];
        }
        for(i = 1; i < n; i++)
            for(j = i+1; j <= n; j++)
                if(f[i] < f[j])
                    dp[j] = max(dp[j], dp[i]+f[j]);
        _max = 0;
        for(i = 1; i <= n; i++)
            if(dp[i] > _max)
                _max = dp[i];
        printf("%d\n",_max);
    }
    return 0;
}