POJ 2533 Longest Ordered Subsequence(LIS）

Longest Ordered Subsequence

#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 1000+5;
int num[maxn];
int dp[maxn];//已num[i]为结尾的最大上升序列长度
int n;
int main() {

    //freopen("data.in", "r", stdin);
    scanf("%d", &n);
    for(int i = 0; i < n; ++i) {
        scanf("%d", &num[i]);
    }

    memset(dp, 0, sizeof(dp));
    for(int i = 0; i < n; ++i) {
        dp[i] = 1;
        for(int j = 0; j < i; ++j) {
            if(num[i] > num[j]) {
                dp[i] = max(dp[i], dp[j]+1);
            }
        }
    }

    int res = 0;
    for(int i = 0; i < n; ++i) {
        res = max(res, dp[i]);
    }

    printf("%d\n", res);
    return 0;
}