Mai intai trebuie sa te autentifici.
Cod sursa(job #2954373)
| Utilizator | Data | 14 decembrie 2022 08:23:24 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
#define MAX_SIZE 200001
int main() {
std::ifstream input("scmax.in");
std::ofstream output("scmax.out");
int n, v[MAX_SIZE] = {0}, dp[MAX_SIZE] = {0};
input >> n;
for (int i = 1; i <= n; ++i) input >> v[i];
int len = 1;
dp[len] = v[1];
for (int i = 2; i <= n; ++i) {
if (v[i] > dp[len]) dp[++len] = v[i];
else {
int l = 1, r = len;
int pos = 0;
while (l <= r) {
int mid = (l + r) / 2;
if (dp[mid] >= v[i]) pos = mid, r = mid - 1;
else l = mid + 1;
}
dp[pos] = v[i];
}
}
output << len << '\n';
return 0;
}
