HDU 1087 Super Jumping! Jumping! Jumping!

简单吧。

#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;

const int N = 1001;
ll f1[N], f2[N];

int main() {
    int n;
    while (cin >> n&&n != 0) {
        for (int i = 0; i < n; i++)
            cin >> f1[i];

        memset(f2, 0, sizeof(f2));

        f2[0] = f1[0];
        int nmax = 0;
        for (int i = 1; i < n; i++) {
            int temp = 0;
            for(int j=0;j<i;j++)
                if (f1[j] < f1[i] && temp < f2[j]) {
                    temp = f2[j];
                }
            f2[i] = temp + f1[i];
            if (nmax < f2[i])
                nmax = f2[i];
        }
        cout << nmax << endl;
    }
}