Pagini recente » Borderou de evaluare (job #2407315) | Cod sursa (job #905345) | Cod sursa (job #1091903) | nr92 | Cod sursa (job #2166655)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,k,v[100001],t[100001],r[100001];
void citire()
{
f>>n;
for(int i=0;i<n;++i)
f>>v[i];
}
void cauta_adauga(int x,int ind)
{
int st=0,dr=k,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x>v[t[mij]])
st=mij+1;
else
dr=mij-1;
}
t[st]=ind;
r[ind]=st>=1?t[st-1]:-1;
}
void rezolva()
{
memset(r,-1,sizeof(r));
for(int i=1;i<n;++i)
{
if(v[i]>v[t[k]])
{
++k;
t[k]=i;
r[t[k]]=t[k-1];
}
else
cauta_adauga(v[i],i);
}
}
void afis()
{
g<<k+1<<"\n";
int x=t[k],nr=k,ans[100001];
while(x!=-1)
{
ans[nr--]=v[x];
x=r[x];
}
for(int i=0;i<=k;++i)
g<<ans[i]<<" ";
}
int main()
{
citire();
rezolva();
afis();
return 0;
}