Super Jumping! Jumping! Jumping!

做的蛮顺的，这题我没想到这么简单

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

解析：就是找每个数列中最大递增数列的和。你注意的就是把每个符合条件的子序列的和算出来，之后记得实时比较一下就行了。

答案如下：

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int num[1005];
int dp[1005];//记录每个符合条件的子序列的和 
int main(){
 int n;
 while(cin>>n&&n){
  for (int i=1;i<=n;i++)
   cin>>num[i];
  int ans=-1;
  for(int i=1;i<=n;i++){
   dp[i]=num[i];
   for(int j=1;j<i;j++){
    if(num[i]>num[j])
     dp[i]=max(dp[i],dp[j]+num[i]);
    ans=max(ans,dp[i]);
   }
  }
  printf("%d\n",ans);
 }
 return 0;
}

做题的人越来越少了，我还在坚持着，倒没有想放弃的意思，就是，日常犯二吧，以前所在意的，所厌恶的，所鼓励的同学，现在也都走了，好冰冷，我突然觉得自己脱离当时的束缚而重新找回自我之路为最正确之决定，自己该遇到的人，不在这里而已。所以也就放松下来，变得随性一点，也许当时的那些事情再经历一次，我可能会选择离开吧，毕竟，心已经死寂了，我终究还是独自旅行，看着眼前的风景，看着这让我无力的一切，看着这毫无所需的世界，麻木么？可我还是一如既往的乐观，只是对他人而已。

有谁听过Sick Boy嘛，我还是那个不被人在意的男孩，依旧是个喜欢安稳的，一切都那么平稳的生活，而不是让我多疑，担忧过度，因为一个人，一件觉得不重要的事而分散过多注意力的生活，我一次次的告诉自己，放下仇恨吧，我在试着平复自己的暴戾，也许，小兽也是在这时才学会自己舔舐伤口的吧。

还是只有专注下的正才是真正的我啊。

可能有些过度疲惫了，最近一直因为往事而再次难以抽出身，也开始愈发沉默，只是正常的按照自己的想法做下去了，我想，最近可能要好好休息了，只是做自己目前需要写的内容就好。

有时候最怕的，是心累吧，而非是身体劳累。