Pagini recente » Cod sursa (job #1945258) | Cod sursa (job #1541334) | Cod sursa (job #1269443) | Cod sursa (job #1995885) | Cod sursa (job #2709579)
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n, m, q, a, b, v[100001];
int main() {
in >> n >> m;
for (int i = 1; i <= n; ++i)
in >> v[i];
while (m--) {
in >> q >> a >> b;
if (q == 1)
v[a] = b;
else
out << *max_element(v + a, v + b + 1) << '\n';
}
return 0;
}