hdu 1257

hdu 1257

#include <iostream>
using namespace std;
int main()
{
    int n,high[1000],m,i,j,k;
        while(cin>>n)
        {
            for(i=0,j=0;i<n;i++)
            {
                cin>>m;
                for(k=0;k<j;k++) {
                    if(high[k]>=m)
                        break;
                }
                if(k<j)
                {
                    high[k]=m;
                }
                else
                {
                    high[j++]=m;
                }
            }
            cout<<j<<endl;
        }
        return 0;
}