poj2533 Longest Ordered Subsequence

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int a[1005],f[1005];
int main(){
	int n;
	int i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		f[i]=1;
	}
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	int maxi=-1;
	for(i=0;i<n;i++){
		for(j=i-1;j>=0;j--)
			if(a[j]<a[i]){
				if(f[j]+1>f[i])
					f[i]=f[j]+1;
				else
					if(a[j]==a[i])   //去重复
						break;
			}
			if(f[i]>maxi)
				maxi=f[i];
	}
	printf("%d\n",maxi);
	return 0;
}