Cod sursa(job #1320691)

Utilizator sicsicFMI-Coteanu Vlad sicsic Data 18 ianuarie 2015 12:46:37
Problema Arbori de intervale Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include<fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int v[400020],n,m,i,op,x,y,q;
void change(int nod,int st,int dr)
{
    if(st==dr)
    {
        v[nod]=y;
    }
    else
    {
        int mij=(st+dr)/2;
        if(x<=mij) change(2*nod,st,mij);
        else change(2*nod+1,mij+1,dr);
    }
}
double maxim(int nod,int st,int dr)
{
    if(st==dr) return v[nod];
    else
    {
        int mij=(st+dr)/2;
        if(y<=mij) return maxim(2*nod,st,mij);
        else if(x>mij) return maxim(2*nod+1,mij+1,dr);
              else return max(maxim(2*nod,st,mij),maxim(2*nod+1,mij+1,dr));
    }
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d", &n);
    scanf("%d", &q);
    for(i=1;i<=n;++i)
    {
        scanf("%d", &y); x=i;
        change(1,1,n);
    }
    for(i=1;i<=q;++i)
    {
        scanf("%d", &op);
        scanf("%d", &x);
        scanf("%d", &y);
        if(op==0) g<<maxim(1,1,n)<<'\n';
        else change(1,1,n);
    }
    return 0;
}