Pagini recente » Cod sursa (job #1846414) | Cod sursa (job #2450584) | Cod sursa (job #342707) | Cod sursa (job #1846236) | Cod sursa (job #2700182)
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
#define debug(v,n) for (int i = 1; i <= (n); ++i) cout << v[i] << " ";
#define next cout << '\n'
using namespace std;
const int N = 100005;
int n, m;
int v[N];
int maxim (int l, int r){
if(l == r)
return v[l];
int m =(l + r) / 2;
return max(maxim(l, m), maxim(m + 1, r));
}
int main() {
//ifstream fin("date.in.txt");
ifstream fin("arbint.in");
ofstream fout("arbint.out");
fin >> n >> m;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
while(m--) {
int q, a, b;
fin >> q >> a >> b;
if(q == 0) {
fout << maxim(a, b) << '\n';
}
else {
v[a] = b;
}
}
return 0;
}