Cod sursa(job #765367)
Utilizator | Data | 7 iulie 2012 13:12:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include<cstdio>
#define N 100001
int a[N],b[N],p[N],i,j,k,c,m,n,u,v;
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]);
for(i=1;i<=n;i++)
{if(a[b[m]]<a[i])
p[i]=b[m],b[++m]=i;
for(j=0,k=m;j<k;)
{c=(j+k)/2;
if(a[b[c]]<a[i])
j=c+1;
else
k=c;}
if(a[i]<a[b[j]])
{if(j)
p[i]=b[j-1];
b[j]=i;}}
for(u=m,v=b[m];u--;v=p[v])
b[u]=v;
printf("%d\n",m);
for(i=0;i<m;i++)
printf("%d ",a[b[i]]);
return 0;}