Pagini recente » Cod sursa (job #1726041) | Cod sursa (job #813386) | Cod sursa (job #73266) | Cod sursa (job #115206) | Cod sursa (job #2169924)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,v[100005],best[100005],p[100005],l[100005],poz,nr,maxim;
void afisare(int i)
{
if(p[i]>0)
afisare(p[i]);
out<<v[i]<<" ";
}
int caut(int x)
{
int p,u,m;
p=0;
u=nr;
m=(p+u)/2;
while (p<=u)
{
if (v[l[m]]<x&&v[l[m+1]]>=x) return m;
else if(v[l[m+1]]<x)
{
p=m + 1;
m=(p + u)/2;
}
else
{
u=m - 1;
m=(p + u)/2;
}
}
return nr;
}
int main()
{
in>>n;
nr=1;
for (int i=1; i<=n; i++)
in>>v[i];
best[1]=l[1]=1;
l[0]= 0;
for (int i=2; i<=n; i++)
{
poz=caut(v[i]);
p[i]=l[poz];
best[i]=poz+1;
l[poz+1]=i;
if (nr<poz+1)
nr=poz+1;
}
poz=0;
for (int i=1; i<=n; i++)
if (maxim<best[i])
maxim=best[i],poz=i;
out<<maxim<<'\n';
afisare(poz);
return 0;
}