Language:Cpp98 100%AC

#include<bits/stdc++.h>
using namespace std;
int a[100000],f[100000];
int maxl(int len)
{
    int maxn = 1;
    for (int i=0;i<len;i++)
	{
        if (f[i] >= maxn && a[len] >= a[i])
		{
            maxn = f[i] + 1;
        }
    }
    return maxn;
}
int main()
{
	int n;
    cin>>n;
	for (int i = 0;i < n;i++)
	{
   		cin>>a[i];
    }
    f[0]=1;
    for(int i = 1;i < n;i++)
	{
    	f[i]=maxl(i);
    }
    sort(f,f+n);
    cout << f[n-1]<< endl;
    return 0;
}