Pagini recente » Cod sursa (job #2912620) | Cod sursa (job #1558142) | Diferente pentru utilizator/rexlcd intre reviziile 2 si 3 | Cod sursa (job #1356058) | Cod sursa (job #2572260)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,pmax,Max,k=1;
int v[100001],st[100001],tata[100001],sol[100001],l[100001];
int caut(int x)
{
int p=1,q=k;
while(p<=q)
{
int mid=(p+q)/2;
if(v[st[mid]]>=x)
q=mid-1;
else
p=mid+1;
}
return p;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sol[1]=1,st[1]=v[1];
Max=k=pmax=1;
for(int i=1;i<=n;i++)
{
if(v[st[k]]>=v[i])
{
int pc=caut(v[i]);
st[pc]=i;
tata[i]=st[pc-1];
l[i]=pc;
}
else
st[++k]=i,tata[i]=st[k-1],l[i]=k;
if(k>Max)
{
Max=k;
pmax=i;
}
}
fout<<Max<<'\n';
int k=1;
sol[1]=v[pmax];
while(tata[pmax]!=0)
{
pmax=tata[pmax];
sol[++k]=v[pmax];
}
for(int i=Max;i>=1;i--)
fout<<sol[i]<<' ';
return 0;
}