poj 2533 Longest Ordered Subs...

#include <stdio.h>#include <stdlib.h>#include <string.h>int main(){    int n;    int maxn;    int a[1000];    int d[1000];    while(~scanf(" %d", &n)){        for(int i = 0;i < n;i++) scanf(" %d",&a[i]);        for(int i = 0;i < n;i++){ maxn = 0; d[i] = 1; for(int j = 0;j < i;j++){     if(a[i] > a[j] && d[j] > maxn)         maxn = d[j]; } d[i] = maxn + 1;        }        for(int i = 0;i < n;i++) if(d[i] > maxn)     maxn = d[i];        printf("%dn",maxn);    }    return 0;}