Pagini recente » Cod sursa (job #332328) | Cod sursa (job #1341543) | Cod sursa (job #1771257) | Cod sursa (job #2745531) | Cod sursa (job #566321)
Cod sursa(job #566321)
#include<cstdio>
#include<fstream>
using namespace std;
#define mm 100001
int v[mm],best[mm],p[mm],L[mm];
int n,maxim, k,nr;
void afis(int i)
{
if (p[i] > 0) afis(p[i]);
printf("%d ",v[i]);
}
int caut(int x)
{
int st=0, dr=nr;
while (st <= dr)
{
int m = (st+dr)>>1;
if (v[L[m]] < x && v[L[m+1]] >= x) return m;
else if (v[L[m+1]] < x) st = m + 1;
else dr = m - 1;
}
return nr;
}
int main()
{
ifstream in ("scmax.in");
freopen("scmax.out","w",stdout);
int i, poz;
nr = 1;
in>>n;
for (i = 1; i <= n; i++) in>>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;
}
printf("%d\n",maxim);
afis(poz);
return 0;
}