Pagini recente » Cod sursa (job #628766) | Cod sursa (job #1567824) | Cod sursa (job #293629) | Cod sursa (job #1888672) | Cod sursa (job #1769339)
#include <cstdio>
using namespace std;
int v[100005], d[100005], c[100005], sol[100005];
int bs(int st, int dr, int val){
int med;
while (st <= dr){
med = (st + dr) >> 1;
if (v[d[med]] >= val)
dr = med - 1;
else
st = med + 1;
}
return st - 1;
}
int main(){
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int n, i, l, aux, k;
scanf("%d", &n);
for (i = 1; i <= n; i ++)
scanf("%d", &v[i]);
d[1] = 1;
l = 1;
for (i = 2; i <= n; i ++){
aux = bs(1, l, v[i]);
if (aux == l)
l ++;
d[aux + 1] = i;
c[i] = d[aux];
}
printf("%d\n", l);
k = l;
aux = d[l];
while (k){
sol[k--] = v[aux];
aux = c[aux];
}
for (i = 1; i <= l; i ++)
printf("%d ", sol[i]);
return 0;
}