Super Jumping! Jumping! Jumping!

http://acm.hdu.edu.cn/showproblem.php?pid=1087

#include<stdio.h>
#include<math.h>
int a[1100], dp[1100] ;
int main()
{
    int n, i, j, max , m ;
    while(scanf("%d", &n),n!=0)
    {
        for(i=0; i<n; i++)
        scanf("%d", &a[i]) ;
        dp[0] = 0 ;
        for(i=0; i<n; i++)
        {
            m = 0;
            for(j=0; j<i; j++)
            if(a[i]>a[j]&&dp[j]>m)
            m = dp[j] ;
            dp[i] = m + a[i] ;
        }
        max = dp[0] ;
        for(i=1; i<n; i++)
        {
            if(max<dp[i])
            max = dp[i] ;
        }
        printf("%d\n", max) ;
    }
    return 0 ;
}