Pagini recente » Cod sursa (job #555514) | Cod sursa (job #1731257) | Cod sursa (job #2162235) | Istoria paginii utilizator/waninghekate12 | Cod sursa (job #883987)
Cod sursa(job #883987)
#include<cstdio>
#include<algorithm>
#define oo 2000000000+10
#define NMAX 100000+5
using namespace std;
int a[NMAX],t[NMAX],p[NMAX],i,j,n,sol,x;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
t[i]=oo;
j=(int)(lower_bound(t+1,t+i+1,a[i])-t);
t[j]=a[i];
p[i]=j;
if(sol<j) sol=j;
}
printf("%d\n",sol);
for(j=sol,i=n;i>0 && j>0;i--)
{
if(p[i]==j)
{
t[j]=a[i];
j--;
}
}
for(i=1;i<=sol;i++) printf("%d ",t[i]);
return 0;
}