Cod sursa(job #144533)

Utilizator GulyanAlexandru Gulyan Data 27 februarie 2008 19:11:08
Problema Arbori de intervale Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include<fstream> 
#include<iostream> 
#include<stdio.h> 

using namespace std; 

int n,m;
int v[100000];
int maxim;
int val;
int pos;
int begin, end;

int Maxim(int a,int b)
{
	if(a>b)return a;
	return b;
}

void AflaValoare(int nod, int st, int dr)
{
	if(st>=begin&&dr<=end)
	{
		if(maxim<v[nod])maxim=v[nod];
		return;
	}
	int mijl = (st+dr)/2;
	if(begin<=mijl)AflaValoare(2*nod,st,mijl);
	if(mijl<end)AflaValoare(2*nod+1,mijl+1,dr);
}

void Update(int nod, int st, int dr)
{
	if(st==dr)
	{
		v[nod] = val;
		return;
	}
	int mijl = (st+dr)/2;
	if(pos<=mijl)Update(nod*2,st,mijl);
	else Update(nod*2+1,mijl+1,dr);
	v[nod] = Maxim(v[nod*2],v[nod*2+1]);
}

int main()   
{   
ifstream f1("arbint.in"); 
ofstream f2("arbint.out");

int i, mod, a, b;

f1>>n>>m;
for(i=1;i<=n;i++)
{
	f1>>val;
	pos = i;
	Update(1,1,n);
}
for(i=0;i<m;i++)
{
	f1>>mod>>a>>b;
	if(mod==0)
	{
		maxim = -1;
		begin = a;
		end = b;
		AflaValoare(1,1,n);
		f2<<maxim<<endl;
	}
	else
	{
		pos = a;
		val = b;
		Update(1,1,n);
	}
}

f1.close();
f2.close();

return 0;}