Pagini recente » Cod sursa (job #2256948) | Cod sursa (job #638448) | Cod sursa (job #650033) | Cod sursa (job #2707032) | Cod sursa (job #2870829)
#include <bits/stdc++.h>
#define maxn 100003
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int n,v[maxn],best[maxn],p[maxn],maxim,k,l[maxn],nr;
void afis(int i)
{
if(p[i]>0)
afis(p[i]);
g<<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()
{
int i,j,poz;
nr=1;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
best[1]=l[1]=1;
l[0]=0;
for(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;
}
maxim=0;
poz=0;
for(i=1;i<=n;i++)
if(maxim<best[i])
{
maxim=best[i];
poz=i;
}
g<<maxim<<'\n';
afis(poz);
return 0;
}