Cod sursa(job #2690740)
Utilizator | Data | 25 decembrie 2020 15:32:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<cstdio>
const int 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);
if(a[b[m]]<a[i])
p[i]=b[m],b[++m]=i;
for(j=0,k=m;j<k;)
a[b[(j+k)/2]]<a[i]?j=(j+k)/2+1:k=(j+k)/2;
if(a[i]<a[b[j]])
j?p[i]=b[j-1]:0,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]]);
}