Cod sursa(job #3285229)
Utilizator | Data | 12 martie 2025 17:06:36 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100005], poz;
vector <int> ans;
int main()
{
f >> n;
for (int i = 1; i <= n; ++i) {
f >> a[i];
}
ans.push_back(a[1]);
for (int i = 2; i <= n; ++i) {
if (a[i] > ans.back()) {
ans.push_back(a[i]);
}
else {
poz = lower_bound(ans.begin(), ans.end(), a[i]) - ans.begin();
ans[poz] = a[i];
}
}
g << (int) ans.size() << '\n';
for (auto it : ans) {
g << it << ' ';
}
return 0;
}