Cod sursa(job #982892)

Utilizator classiusCobuz Andrei classius Data 10 august 2013 14:19:48
Problema Arbori de intervale Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <fstream>

using namespace std;
FILE *f=freopen("arbint.in","r",stdin);
FILE *g=freopen("arbint.out","w",stdout);

int mx[1<<19];
int p,x,y;

void insert(int a,int i,int j){

    if(i==j){
        mx[a]=x;
        return;
    }

    int m=(i+j)>>1;
    if(p>m) insert((a<<1)+1,m+1,j);
    else insert(a<<1,i,m);

    mx[a]=mx[a<<1];
    if(mx[(a<<1)+1]>mx[a]) mx[a]=mx[(a<<1)+1];

    return;
}

int query(int a,int i,int j){

    if(x<=i&&j<=y)
        return mx[a];

    int m=(i+j)>>1,a1=0,a2=0;

    if(x<=m) a1=query(a<<1,i,m);
    if(y>m) a2=query((a<<1)+1,m+1,j);


    int mx=a1;
    if(a2>mx) mx=a2;

    return mx;
}

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);

    for(int i=1;i<=n;i++){
        int x;
        scanf("%d",&x);
        ::x=x,p=i;
        insert(1,1,n);
    }

    for(int t=1;t<=m;t++){
        int cd,x,y;
        scanf("%d%d%d",&cd,&x,&y);

        if(cd){
            ::x=y,p=x;
            insert(1,1,n);
        }
        else{
            ::x=x,::y=y;
            printf("%d\n",query(1,1,n));
        }
    }

    return 0;
}