Cod sursa(job #727858)

Utilizator geniucosOncescu Costin geniucos Data 28 martie 2012 12:24:41
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include<cstdio>
using namespace std;
int i1,n,i,m,p,u,nr,maxi,a[100002],poz[100002],st[100002],b[100002];
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[i]==1)
		i1=i;
for(i=1;i<=n;i++)
{
	if(a[i]==1)
		i1=i;
	if(a[i]>st[nr])
	{
		nr++;
		st[nr]=a[i];
		poz[i]=nr;
	}
	else
	{
		p=1;
		u=nr;
		while(p<=u)
		{
			m=(p+u)/2;
			if(st[m]>a[i]) u=m-1;
			else
			if(st[m]<a[i]) p=m+1;
			else break;
		}
		if(p<=u)
		{
		for(i1=m;i1<=nr;i1++)
			if(st[i1]!=a[i]) break;
		i1--;
		}
		else i1=p;
		if(i1<=nr)
		{
			st[i1]=a[i];
			poz[i]=i1;
		}
		else poz[i]=nr;
	}
}
for(i=1;i<=n;i++)
	if(poz[i]>maxi)
	{
		i1=i;
		maxi=poz[i];
	}
printf("%d\n",maxi);
maxi++;
nr=0;
for(i=i1;i>=1;i--)
	if(poz[i]==maxi-1)
	{
		nr++;
		b[nr]=a[i];
		maxi--;
		if(maxi==0) break;
	}
for(i=nr;i>=1;i--)
	printf("%d ",b[i]);
return 0;
}