Super Jumping! Jumping! Jumping!

Super Jumping! Jumping! Jumping!

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.

翻译:

这个游戏可以由两个或两个以上的玩家玩。它由一个棋盘（棋盘）和一些棋子（棋子）组成，所有棋子都用正整数或“开始”或“结束”标记。玩家从起点开始，最后必须跳入终点。在跳跃的过程中，玩家将访问路径中的棋子，但是每个人都必须从一个棋子跳到另一个棋子绝对大（你可以假定起点是最小的，终点是最大的）。所有玩家都不能倒退。一跳可以从一个棋子跳到另一个棋子，也可以跨越许多棋子，甚至你可以直接从起点跳到终点。在这种情况下你当然得零分。一个运动员是胜利者，只要他能根据他的跳跃解决方案得到更大的分数。注意，你的分数来自于你跳跃路径中棋子的价值之和。 你的任务是根据给定的棋子列表输出最大值。

输入

输入包含多个测试用例。每个测试用例在一行中描述如下： N值1值2…值 保证N不大于1000，且所有值均在32-int范围内。 以0开头的测试用例终止输入，不处理此测试用例。

输出

对于每种情况，按规则打印最大值，一行打印一次。

这道题我在一开始做的时候非常得懵,仔细细想之后,我才看懂题意,在看懂题意之后,我想到得解决办法是用类似bfs那个板子的方法来写,然后就一直Memory Limit Exceeded…
题意: 题意很简单,就是给你一组数,让你求出最大递增子序列的和
思路: 用dp来写,只要能明白这道题的状态转移方程即可求解

AC代码:

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n==0)
            return 0;
        int vis[10005],dp[10005];
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&vis[i]);
            dp[i]=vis[i];
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=i;j++)
            {
                if(vis[i]>vis[j])
                    dp[i]=max(dp[i],dp[j]+vis[i]);
            }
        }
        sort(dp+1,dp+1+n);
        printf("%d\n",dp[n]);
    }
}