Pagini recente » Cod sursa (job #592446) | Cod sursa (job #1695111) | Cod sursa (job #946727) | Cod sursa (job #2579223) | Cod sursa (job #2172242)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int nMax = 100005;
int a[nMax], dp[nMax], rec[nMax], ans[nMax];
inline int Cauta(int x, int len) {
int st = 1, dr = len, ret = 0;
while(st <= dr) {
int m = (st + dr) / 2;
if(x > dp[m]) {
st = m + 1;
}
else {
ret = m;
dr = m - 1;
}
}
return ret;
}
int main()
{
int n;
f >> n;
for(int i = 1; i <= n; i++) {
f >> a[i];
}
dp[1] = a[1];
rec[1] = 1;
int k = 1;
for(int i = 2; i <= n; i++){
if(a[i] > dp[k]) {
dp[++k] = a[i];
rec[i] = k;
}
else {
int p = Cauta(a[i], k);
dp[p] = a[i];
rec[i] = p;
}
}
g << k << "\n";
int lung = k;
for(int i = n; i >= 1; i--) {
if(rec[i] == lung) {
ans[lung] = a[i];
lung--;
}
}
for(int i = 1; i <= k; i++) {
g << ans[i] << " ";
}
return 0;
}