HDU 1087 Super Jumping! Jumping! Jumping!

 最长递增子序列

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define MAX  1001
using namespace std;

int dp[MAX];

int main(){
    int n;
    while(cin >> n && n){
        int player[MAX];
        for(int i = 1 ; i <= n ; i ++ ) cin >> player[i];
        memset(dp,0,sizeof(dp));

        int maxsum = 0;
        for(int i = 1; i <= n; i ++ ){
            dp[i] = player[i];
            for(int j = 1; j < i ; j ++ ){
                if(player[i] > player[j])
                    dp[i] = max(dp[i],dp[j] + player[i]);
            }
            maxsum = max(maxsum,dp[i]);
        }
        cout<<maxsum<<endl;
    }

    return 0;
}