Pagini recente » Cod sursa (job #2986691) | Cod sursa (job #2813961) | Cod sursa (job #2849089) | Monitorul de evaluare | Cod sursa (job #1810544)
#include <bits/stdc++.h>
#define nmax 100000
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int poz[nmax],lis[nmax],n,lg,a[nmax],sol[nmax];
///O(nlogn)
void Citire()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
}
int CautBin(int x,int capat)
{
int st=1,dr=capat,mij,poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(lis[mij]>=x)
{
poz=mij;
dr=mij-1;
}
else st=mij+1;
}
return poz;
}
void Rezolvare()
{
int lg,x,i,nsol=0;
lg=1;
lis[lg]=a[1];
poz[lg]=1;
for(i=2;i<=n;i++)
{
if(a[i]<=lis[1])
{
lis[1]=a[i];
poz[i]=1;
}
else if(a[i]>lis[lg])
{
lis[++lg]=a[i];
poz[i]=lg;
}
else
{
x=CautBin(a[i],lg);
lis[x]=a[i];
poz[i]=x;
}
}
int maxim=0;
for(i=1;i<=n;i++)
maxim=max(maxim,poz[i]);
fout<<maxim<<"\n";
for(i=n;i>=1;i--)
if(poz[i]==maxim)
{
maxim--;
sol[++nsol]=a[i];
}
for(i=nsol;i>=1;i--)
fout<<sol[i]<<" ";
fout<<"\n";
}
int main()
{
Citire();
Rezolvare();
fin.close();
fout.close();
return 0;
}