Pagini recente » Borderou de evaluare (job #265008) | Borderou de evaluare (job #164063) | Borderou de evaluare (job #1690268) | Borderou de evaluare (job #1376992) | Cod sursa (job #3001203)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100005],d[100005],p[100005];
int sol[100005];
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
}
void sclm()
{
int k=1;
d[k]=v[1];
p[1]=1;
for(int i=2;i<=n;i++)
{
if(v[i]>d[k])
d[++k]=v[i],p[i]=k;
else
{
int poz=k+1,st=1,dr=k;
while(st<=dr)
{
int mij=(st+dr)/2;
if(d[mij]>=v[i])
poz=mij,dr=mij-1;
else
st=mij+1;
}
d[poz]=v[i];
p[i]=poz;
}
}
g<<k<<"\n";
int j=n;
for(int i=k;i>=1;i--)
{
while(p[j]!=i)
j--;
sol[i]=j;
}
for(int i=1;i<=k;i++)
g<<v[sol[i]]<<" ";
}
int main()
{
citire();
sclm();
return 0;
}