Pagini recente » Cod sursa (job #2432652) | Cod sursa (job #1240951) | Cod sursa (job #1441794) | Cod sursa (job #1113508) | Cod sursa (job #2687258)
#include <bits/stdc++.h>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int aint[400005];
int a,b;
int n,m;
int x;
int op;
int elem,val;
int get_max(int pos, int st, int dr) {
if (b < st || a > dr) {
return 0;
}
if (dr <= b && a <= st) {
return aint[pos];
}
int mid = (st+dr)/2;
return max(get_max(2*pos,st,mid),get_max(2*pos+1,mid+1,dr));
}
void update(int pos, int st, int dr) {
if (elem < st || dr < elem) {
return;
}
if (st == dr) {
aint[pos] = val;
return ;
}
int mid = (st+dr)/2;
update(2*pos,st,mid);
update(2*pos+1,mid+1,dr);
aint[pos] = max(aint[2*pos],aint[2*pos+1]);
}
int main()
{
f >> n >> m;
for (int i=1;i<=n;i++) {
f >> val;
elem = i;
update(1,1,n);
}
for (int i=1;i<=m;i++) {
f >> op;
if (op == 0) {
f >> a >> b;
g << get_max(1,1,n) << '\n';
}
else {
f >> elem >> val;
update(1,1,n);
}
}
return 0;
}