Pagini recente » Cod sursa (job #440795) | Cod sursa (job #2118472) | Cod sursa (job #799752) | Cod sursa (job #775012) | Cod sursa (job #2113055)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[100001],l[100001],nl,urm[100001];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
l[1]=n;
urm[n]=n+1;
nl=1;
for(int i=n-1;i>0;i--)
{
if(a[i]<a[l[nl]])
{
nl++;
l[nl]=i;
urm[i]=l[nl-1];
}
else if( a[i]>=a[l[1]])
{
l[1]=i;
urm[i]=n+1;
}
else
{
int st=1,dr=nl-1,mij,gasit=0;
while(!gasit)
{
mij=(st+dr)/2;
if(a[l[mij]]>a[i] && a[i]>=a[l[mij+1]] )
{
gasit=1;
l[mij+1]=i;
urm[i]=l[mij];
}
else if(a[l[mij]]<=a[i])
dr=mij-1;
else
st=mij+1;
}
}
}
fout<<nl<<'\n';
int p=l[nl];
while(p<=n)
{
fout<<a[p]<<" ";
p=urm[p];
}
return 0;
}