Cod sursa(job #1034376)

Utilizator enedumitruene dumitru enedumitru Data 17 noiembrie 2013 19:56:07
Problema Arbori de intervale Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>
using namespace std;
ifstream f("arbint.in"); ofstream g("arbint.out");
int n,m,vmax,AI[3*100000];
inline int Maxim(int a, int b) {return a>b ? a : b;}
void Inserare(int nod,int st,int dr,int indice, int x)
{   if(st==dr) AI[nod]=x;
	else
	{	int mij=(st+dr)>>1;
		if(indice<=mij)	 Inserare(nod*2,st,mij,indice,x);
					else Inserare(nod*2+1,mij+1,dr,indice,x);
		AI[nod]=Maxim(AI[nod*2],AI[nod*2+1]);
	}
}
void Interogare(int nod,int st, int dr, int a,int b)
{   if(a<=st && dr<=b) vmax=Maxim(vmax,AI[nod]);
    else
	{	int mij=(st+dr)>>1;
		if(a<=mij) Interogare(2*nod,st,mij,a,b);
		if(b>mij)  Interogare(2*nod+1,mij+1,dr,a,b);
	}
}
int main()
{   f>>n>>m;
    for(int x,i=1;i<=n;++i) f>>x, Inserare(1,1,n,i,x);// creare AI
    while(m--)
    {   int Op,a,b;
		f>>Op>>a>>b;
        if(Op) Inserare(1,1,n,a,b);
        else vmax=0, Interogare(1,1,n,a,b), g<<vmax<<'\n';
    }
    return 0;
}