最长上升子序列

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1299

#include<stdio.h>
#include<string.h>
#define Max 1000
int b[Max+10] ;
int maxlen[Max+10] ;
int main()
{
    int m, n, i, j ;
    scanf("%d", &n) ;
    for(i=1; i<=n; i++)
    scanf("%d", &b[i]) ;
    maxlen[1] = 1 ;
    for(i=2; i<=n; i++)
    {
        m = 0 ;
        for(j=1; j<i; j++)
        if(b[i]>b[j])
        if(m<maxlen[j])
        m = maxlen[j] ;
        maxlen[i] = m + 1 ;
    }
    int nmax = -1 ;
    for(i=1; i<=n; i++)
    if(nmax<maxlen[i])
    nmax = maxlen[i] ;
    printf("%d\n", nmax) ;
    return 0 ;
}