hdu1087

最大递增子序列

#include <iostream>

#include <string>

#include <algorithm>

#include <cstdio>

#include <vector>

#include <map>

#include <iterator>

#include <cstring>

#include <cmath>

using namespace std;

int p[1005];

int dp[1005];

int main() {

int n;

while (cin>>n && n) {

memset(dp, 0, sizeof(dp));

for (int i = 0; i < n; i++) {

cin >> p[i];

dp[i] = p[i];

}

for (int i = 1; i < n; i++) {

for (int j = 0; j < i; j++) {

if (p[i] > p[j] && dp[i] < dp[j] + p[i])

dp[i] = dp[j] + p[i];

}

}

int sum = 0;

for (int i = 0; i < n; i++) if (sum < dp[i]) sum = dp[i];

cout << sum << endl;

}

return 0;

}