Pagini recente » Cod sursa (job #1979894) | Cod sursa (job #1839846) | Cod sursa (job #2277872) | Cod sursa (job #761418) | Cod sursa (job #2414998)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long n,v[100001],p[100001],q[100001],len,maxx=0,imax;
int inssert(int a,int st, int dr)
{
int mid=(st+dr)/2;
if(st==dr)
{
if(dr>len)
len++;
q[st]=a;
return st;
}
else
{
if(a<q[mid])
return inssert(a,st,mid);
else
if(a>q[mid])
return inssert(a,mid+1,dr);
}
}
void buildPQ()
{
len=0;
for(int i=1;i<=n;i++)
{
p[i]=inssert(v[i],1,len+1);
}
}
void buildSOL()
{
int k=n;
for(int i=len;i>=1;i--)
{
while(p[k]!=i)
k--;
q[i]=v[k];
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
buildPQ();
buildSOL();
fout<<len<<"\n";
for(int i=1;i<=len;i++)
fout<<q[i]<<" ";
return 0;
}