Cod sursa(job #2692649)
| Utilizator | Data | 3 ianuarie 2021 13:48:21 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define ll long long
#define cin fin
#define cout fout
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, v[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int query = 1; query <= m; query++) {
int type, a, b;
cin >> type >> a >> b;
if (type == 1)
v[a] = b;
else {
int maxx = 0;
for (int i = a; i <= b; i++)
maxx = max(maxx, v[i]);
cout << maxx << '\n';
}
}
return 0;
}