Pagini recente » Cod sursa (job #1698645) | Cod sursa (job #3281326) | Cod sursa (job #1720268) | Cod sursa (job #2721503) | Cod sursa (job #2749331)
#include <cstdio>
#define N 100005
using namespace std;
int L, a[N], poz, p[N], h[N], v[N], n;
inline int Bs(int x)
{
int st = 1, dr = L, mj;
int pos = 0;
if (v[L] < x) return L + 1;
while ( st <= dr)
{
mj = (st + dr)/2;
if (x <= v[mj])
{
pos = mj;
dr = mj - 1;
}
else
st = mj + 1;
}
return pos;
}
int main()
{
freopen("scmax.in","r", stdin);
freopen("scmax.out","w", stdout);
scanf("%d",&n);
L = 0;
for (int i = 1;i <= n; ++i)
{
scanf("%d",&a[i]);
poz = Bs(a[i]);
if (poz > L)
++L, poz = L;
p[i] = poz;
v[poz] = a[i];
}
printf("%d\n", L);
poz = L;
for (int i = n; i >= 1; --i)
if (p[i] == poz)
h[poz] = a[i],
--poz;
for (int i = 1; i <= L; ++i)
printf("%d ", h[i]);
return 0;
}