Cod sursa(job #1501421)

Utilizator MihneaGhiraMihnea MihneaGhira Data 13 octombrie 2015 13:45:51
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.38 kb
#include<fstream>
#define DIM 400005
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int operatie,i,m,n,p,x,maxim;
int A[DIM],V[DIM];
 
void build(int nod,int st,int dr){
    if(st==dr){
        A[nod] = V[st];
    }else{
        int mid = (st+dr)/2;
        build(2*nod,st,mid);
        build(2*nod+1,mid+1,dr);
        A[nod] = max(A[2*nod],A[2*nod+1]);
    }
    return;
}
 
void update(int nod,int st,int dr,int p,int x){
    if(st == dr){
        A[nod] = x;
    }else{
        int mid = (st+dr)/2;
        if(p <= mid)
            update(2*nod,st,mid,p,x);
        if(p > mid)
            update(2*nod+1,mid+1,dr,p,x);
        A[nod] = max(A[2*nod],A[2*nod+1]);
    }
}
 
void question(int nod,int st,int dr,int a,int b){
    if(a <= st && dr <= b){
        maxim = max(maxim,A[nod]);
    }else{
        int mid = (st+dr)/2;
        if(a <= mid)
            question(2*nod,st,mid,a,b);
        if(b > mid)
            question(2*nod+1,mid+1,dr,a,b);
    }
}
 
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++){
        fin>>V[i];
    }
    build(1,1,n);
    for(i=1;i<=m;i++){
        fin >> operatie >> p >> x;
        if(operatie == 1){
            update(1,1,n,p,x);
        }else{
            maxim = -100000000;
            question(1,1,n,p,x);
            fout << maxim <<"\n";
        }
    }
    return 0;
}