Cod sursa(job #2893030)
| Utilizator | Data | 24 aprilie 2022 18:41:15 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
int v[100001], N, M, nr, a, b;
int main() {
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
fin >> N >> M;
for (int i = 1; i <= N; ++i) {
fin >> v[i];
}
for (int i = 1; i <= N; ++i) {
fin >> nr >> a >> b;
if (nr == 0) {
int maxim = -1;
for (int j = a; j <= b; ++j) {
if (v[j] > maxim) {
maxim = v[j];
}
}
fout << maxim << '\n';
} else if (nr == 1) {
v[a] = v[b];
}
}
return 0;
}
