最长单增子序列

#include <cstdio>
#include <algorithm>
using namespace std;

#define MAX 1001

int a[MAX], b[MAX];

int main(int argc, char const *argv[]) {
    int cnt, ans(0);
    scanf("%d",&cnt);
    for(int i=0; i<cnt; i++){
        scanf("%d",&a[i]);
        b[i] = 1;
    }

    for(int i=1; i<cnt; i++){
        for(int j=0, tmp; j<i; j++){
            if(a[j] < a[i]){
                tmp = b[j]+1;
                b[i] = max(tmp, b[i]);
            }
        }
    }

    for(int i=0; i<cnt; i++)
        ans = max(ans, b[i]);
    printf("%d\n",ans);
    return 0;
}