HDU - 1087 I 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 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.

输出:

For each case, print the maximum according to rules, and one line one case.

翻译:

现在有一种叫做超级跳跳跳的游戏很流行.
期盼上面有N个数字和起点终点(数字不包括起点和终点),起点在最左边,终点在最右边(指地图外面
玩家从起点往右跳,每一步只能跳到比所在的点的数字大的点上,直到到达终点
在这个过程之中,踩到的数字的和最多能有多少?

输入:

有多组输入数据
每一行第一个数字是N,随后跟着N个整数,代表从左到右每个点上的数字
输入0时结束

输出:

对于每一组数据,输出按照规则能够踩到的数字的和的最大值.

题目分析:

对于每一个点i,我们都假设ans[i]是第一步踩在i点上所能得到的最大值.
对于每一个数字大于i而且位置在i后面的点,我们都把他的数字加到ans[i]上
最后在ans[i]中的最大值,便是题目答案

代码:

#include<stdio.h>
#include<memory.h>
long chess[1001], ans[1001], max;
int n;

int main(){
        scanf("%d" ,&n);
        while(n){
                for(long i = 1; i <= n; i++) scanf("%ld", &chess[i]);
                max = 0;
                memset(ans, 0, sizeof(ans));
                for(long i = 1 ;i <= n; i++){
                        ans[i] = chess[i];
                        for(long j = 1; j <= i; j++){
                                if(chess[j] < chess[i] && ans[j] + chess[i] > ans[i]){
                                        ans[i] = chess[i] + ans[j];
                                }
                        }
                }
                for(long i = 1; i <= n; i++)
                        if(max < ans[i])
                                max = ans[i];
                printf("%ld\n", max);
                scanf("%d", &n);
        }
}