#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int a[1010],len[1010];
int main()
{
int n;
while(cin>>n){
for(int i=1;i<=n;i++){
cin>>a[i];len[i]=1;
}
int ans=1;
for(int i=2;i<=n;i++){
int max=0;
for(int j=1;j<=i-1;j++){
if(a[j]<a[i]&&len[j]>max){//len[j]表示到第j个元素时最大递增子串的长度
max=len[j];
}
}
len[i]=max+1;
if(ans<len[i])ans=len[i];
}
cout<<ans<<endl;
}
}
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
7 1 7 3 5 9 4 8
4
题意:求最大递增子串的长度