Pagini recente » Cod sursa (job #530070) | Cod sursa (job #1704048) | Cod sursa (job #1383751) | Cod sursa (job #2045486) | Cod sursa (job #2872743)
#include <fstream>
#define Nmax 100003
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[Nmax], best[Nmax], p[Nmax], maxim, k, L[Nmax], nr;
int caut(int x)
{
int prim=0;
int ult=nr;
int m=(prim+ult)/2;
while (prim<=ult)
{
if (v[L[m]]<x && v[L[m+1]]>=x)
return m;
else if (v[L[m+1]]<x)
{
prim=m+1;
m=(prim+ult)/2;
}
else
{
ult=m-1;
m=(prim+ult)/2;
}
}
return nr;
}
void afis(int i)
{
if (p[i]>0)
afis(p[i]);
fout<<v[i]<<' ';
}
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
fin>>v[i];
L[1]=best[1]=1;
L[0]=0;
int poz=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;
}
maxim=0;
poz=0;
for (int i=1;i<=n;i++)
{
if (maxim<best[i])
{
maxim=best[i];
poz=i;
}
}
fout<<maxim<<'\n';
afis(poz);
return 0;
}