Pagini recente » Cod sursa (job #1128771) | Cod sursa (job #2362797) | Cod sursa (job #458798) | Cod sursa (job #87246) | Cod sursa (job #1015613)
#include <cstdio>
using namespace std;
int a[100002],n,p[100002],q[100002];
int len;
void citire()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
}
int inserare(int v)
{
int st=0;
int dr=len;
while(st<=dr )
{
int m=(st+dr)/2;
if(v<q[m])
dr=m-1;
else
st=m+1;
}
q[st]=v;
if(st>len)
len++;
return st;
}
void constr()
{
q[0]=a[0];
p[0]=0;
for(int i=1;i<n;i++)
p[i]=inserare(a[i]);
}
void afis(int i,int lg)
{
if(i>=0)
if(p[i]==lg)
{
int k=i;
afis(i-1,lg-1);
printf("%d ",a[k]);
}
else
{
afis(i-1,lg);
}
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
citire();
constr();
afis(n,len);
return 0;
}