Pagini recente » Cod sursa (job #2004337) | Cod sursa (job #2865743) | Cod sursa (job #3179871) | Cod sursa (job #296032) | Cod sursa (job #1034894)
#include <iostream>
#include <fstream>
using namespace std;
long long x[100001];
int n,lis[100001],maxx,maxs;
int main()
{
int i,j;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
cin>>x[i];
lis[n]=1;
for(i=n-1;i>=1;i--)
{
for(j=i+1;j<=n;j++)
{
if(x[i]<x[j] && lis[i]<=lis[j])
{
lis[i]=lis[j];
}
}
lis[i]=lis[i]+1;
if(lis[i]>maxs) maxs=lis[i];
}
cout<<maxs;
cout<<"\n";
return 0;
}