Pagini recente » Cod sursa (job #1323797) | Cod sursa (job #2407537) | Borderou de evaluare (job #1036694) | Cod sursa (job #277921) | Cod sursa (job #2260676)
#include<iostream>
#include<fstream>
using namespace std;
#define MAX 100005
int maxArb[2*MAX+5], poz, val, a, b, maxx;
void update(int nod, int left, int right){
if(left==right){
maxArb[nod]=val;
return;
}
int mid=(left+right)/2;
if(poz<=mid) update(nod*2,left,mid);
else update(2*nod+1,mid+1,right);
maxArb[nod]=max(maxArb[2*nod],maxArb[2*nod+1]);
}
void getMax(int nod, int left, int right){
if(a<=left && right<=b){
maxx=max(maxx,maxArb[nod]);
return;
}
int mid=(left+right)/2;
if(a<=mid) getMax(2*nod,left,mid);
if(mid<b) getMax(2*nod+1,mid+1,right);
}
int main(){
int i,n,m,c;
ifstream in("arbint.in");
FILE *out = fopen("arbint.out","w");
in>>n>>m;
for(i=1;i<=n;i++){
poz=i; in>>val;
update(1,1,n);
}
for(i=1;i<=m;i++){
in>>c>>a>>b;
if(c==0){
maxx=-1;
getMax(1,1,n);
fprintf(out,"%d\n",maxx);
}
else{
poz=a, val=b;
update(1,1,n);
}
}
in.close(); fclose(out);
return 0;
}