Cod sursa(job #1247277)

Utilizator horiainfoTurcuman Horia horiainfo Data 22 octombrie 2014 16:10:33
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.48 kb
#include <fstream>
#include <cstdio>
using namespace std;
ofstream fout("arbint.out");
#define NMAX 100000
int n,m,x,y,v[NMAX],a[4*NMAX+100];
int cons(int inc,int sf,int poz)
{
    if(inc==sf) a[poz]=v[inc];
    else
        if(inc<sf)
        {
            int mij=(inc+sf)/2;
            int aux=cons(inc,mij,poz*2);
            int aux2=cons(mij+1,sf,poz*2+1);
            if(aux<aux2) aux=aux2;
            a[poz]=aux;
        }
    return a[poz];
}
int vmax(int nod,int inc,int sf)
{
    if(x<=inc && sf<=y) return a[nod];
    else
    {
        int aux=-1,aux2=-1;
        int mij=(inc+sf)/2;
        if(x<=mij)
            aux=vmax(nod*2,inc,mij);
        if(y>mij)
            aux2=vmax(nod*2+1,mij+1,sf);
        if(aux<aux2) aux=aux2;
        return aux;
    }
}
void act(int nod,int inc,int sf)
{
    int mij=(inc+sf)/2;
    if(inc<sf)
    {
        if(x<=mij)
            act(nod*2,inc,mij);
        else
            act(nod*2+1,mij+1,sf);
        if(a[nod*2]<a[nod*2+1])
            a[nod]=a[nod*2+1];
        else
            a[nod]=a[nod*2];
    }
    else
        if(inc==sf) a[nod]=y;
}
int main()
{
    freopen("arbint.in","r",stdin);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    a[1]=cons(1,n,1);
    int tip;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&tip,&x,&y);
        if(tip==0)
            fout<<vmax(1,1,n)<<'\n';
        else
            act(1,1,n);
    }
    return 0;
}