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
题意及分析:题目要求从开始的地方往后跳,每次只能跳到比原先位置数字大的地方,比如原来在3,那么下次只能跳比3大的数或者结束,求从开始到结束所跳的数字的最大和。
我用的是两重for循环直接假定每个位置的值在a[i]<a[i+1]的情况下都是可以跳的,那么对于每一个位置的值,如果从上一个位置跳到当前位置的值的和大于当前值,并且上一个位置的值大于当前位置值,那么这是可以跳的。
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main(){
int n,i,j,m;
while(cin>>n){
if(n==0){
break;
}
int max=-1000;
int a[1005];
int dp[1005]={0};
for(i=0;i<n;i++){
cin>>a[i];
}
dp[0]=a[0];
for(i=1;i<n;i++){
dp[i]=a[i];
for(j=0;j<i;j++){
if(a[i]>a[j]&&a[i]+dp[j]>dp[i]){
dp[i]=a[i]+dp[j];
}
}
}
for(i=0;i<n;i++){
if(max<dp[i]){
max=dp[i];
}
}
cout<<max<<endl;
}
return 0;
}