Pagini recente » Cod sursa (job #3130502) | Cod sursa (job #224545) | Cod sursa (job #1694661) | Cod sursa (job #2140864) | Cod sursa (job #1255529)
#include <cstdio>
#define nmax 100003
using namespace std;
int n, v[nmax], best[nmax], p[nmax], maxim, k, l[nmax], nr;
void afis(int i)
{
if (p[i]>0) afis(p[i]);
printf("%d ", v[i]);
}
int BS(int st, int dr, int x)
{
if(st>dr)return nr;
int m=(st+dr)/2;
if (v[l[m]] < x && v[l[m+1]] >= x) return m;
if (v[l[m+1]] < x) return BS(m+1, dr, x);
else return BS(st, m-1, x);
}
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int i, poz;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &v[i]);
best[1]=l[1]= 1; l[0]=0;
for (nr=1, i=2; i<=n; i++)
{
poz=BS(0, nr, 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);
fclose(stdin);
fclose(stdout);
return 0;
}