Pagini recente » Cod sursa (job #1152569) | Cod sursa (job #1151937) | Cod sursa (job #3319573) | Cod sursa (job #1344050) | Cod sursa (job #3321973)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main() {
ios::sync_with_stdio(false);
fin.tie(nullptr);
int N;
fin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++)
fin >> a[i];
vector<int> d(N + 1);
vector<int> p(N, -1);
int L = 0;
for (int i = 0; i < N; i++) {
int st = 1, dr = L, poz = 0;
while (st <= dr) {
int mid = (st + dr) / 2;
if (a[d[mid]] < a[i]) {
poz = mid;
st = mid + 1;
} else {
dr = mid - 1;
}
}
p[i] = (poz == 0 ? -1 : d[poz]);
d[poz + 1] = i;
if (poz + 1 > L)
L = poz + 1;
}
vector<long long> sol;
int idx = d[L];
while (idx != -1) {
sol.push_back(a[idx]);
idx = p[idx];
}
reverse(sol.begin(), sol.end());
fout << L << "\n";
for (int i = 0; i < L; i++)
fout << sol[i] << " ";
fout << "\n";
return 0;
}