Pagini recente » Cod sursa (job #2312806) | Cod sursa (job #675767) | Cod sursa (job #3236716) | Cod sursa (job #2195015) | Cod sursa (job #289177)
Cod sursa(job #289177)
#include <stdio.h>
#define nm 100010
int i, n, m, mx, sol, poz;
int v[nm], q[nm], p[nm];
void read()
{
scanf("%d ", &n);
for (i=1; i<=n; ++i)
{
scanf("%d ", &v[i]);
}
}
int bs(int l, int r, int x)
{
int mid = (l+r)/2;
if (l > r)
return l;
if (q[mid] > x)
return (bs(l, mid-1, x));
if (q[mid] < x)
return (bs(mid+1, r, x));
else
return mid;
}
void solve()
{
q[1] = v[1];
p[1] = 1;
p[0] = 0;
m = 1;
mx = 1;
for (i=2; i<=n; ++i)
{
poz = bs(1, m, v[i]);
p[i] = poz;
q[poz] = v[i];
if (poz > m)
m = poz;
if (mx < m)
mx = m;
}
sol = mx;
for (i=n; i>0; --i)
{
if (p[i] == mx)
{
//printf("%d %d\n", i, v[i]);
q[mx] = v[i];
--mx;
}
}
}
void write()
{
printf("%d\n", sol);
for (i=1; i<=sol; ++i)
printf("%d ", q[i]);
}
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out","w",stdout);
read();
solve();
write();
return 0;
}