Pagini recente » Cod sursa (job #2072180) | Cod sursa (job #1028101) | Cod sursa (job #2363594) | Cod sursa (job #2397129) | Cod sursa (job #267898)
Cod sursa(job #267898)
#include <stdio.h>
#define INF 0x3f3f
long v[100001],p[100001],q[100001],s[100001],n,l;
long caut(long k,long i,long j)
{
long m;
m=(i+j)/2;
if(i==j)
{
if(j>l) q[++l+1]=INF;
q[i]=k;
return i;
}
if(k<q[m]) return caut(k,i,m);
return caut(k,m+1,j);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
long i,k;
scanf("%d",&n);
for(i=1; i<=n; i++) scanf("%d",&v[i]);
l=0; q[1]=INF;
for(i=1; i<=n; i++)
p[i]=caut(v[i],1,l+1);
k=n;
for(i=l; i; i--)
{
while(p[k]!=i) k--;
s[i]=v[k];
}
printf("%d\n",l);
for(i=1; i<=l; i++)
printf("%d ",s[i]);
printf("\n");
}