Cod sursa(job #1040353)

Utilizator alexsuciuAlex Suciu alexsuciu Data 24 noiembrie 2013 14:14:05
Problema Arbori de intervale Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb
#include<iostream>
#include<fstream>
using namespace std;
long m,n,a,b,i,j,st,dr,x,tip;
long arb[10000000],maxi=-1;

void act(long r,long st,long dr,long x,long poz)
{
    if(st==dr)
    {
        arb[r]=x;
        return;
    }
   long mij=(st+dr)/2;
     if(poz<=mij) act(r*2,st,mij,x,poz);
    else act(r*2+1,mij+1,dr,x,poz);
    if(arb[r*2]>arb[r*2+1]) arb[r]=arb[r*2];
    else arb[r]=arb[r*2+1];
}

void inter(long r,long st,long dr,long a,long b)
{
     if (a<=st && dr<=b)
     {
          if (maxi<arb[r] ) maxi=arb[r];
          return;
     }
    long mij=(st+dr)/2;
     if (a<=mij) inter(2*r,st,mij,a,b);
     if (mij<b) inter(2*r+1,mij+1,dr,a,b);
}

/*void srd(int r)
{
    if(arb[r])
    {
        srd(2*r);
        cout<<arb[r]<<" ";
        srd(2*r+1);
    }
}*/

int main()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x;
        act(1,1,n,x,i);
    }
    for(i=1;i<=m;i++)
    {
        f>>tip>>a>>b;
        if (tip==0)
        {
             maxi=-1;
             inter(1,1,n,a,b);
            g<<maxi<<'\n';
        }
        else
        {
            act(1,1,n,b,a);
        }
    }
}