Cod sursa(job #1887938)

Utilizator flibiaVisanu Cristian flibia Data 21 februarie 2017 20:37:42
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>
#define mx -INT_MAX

using namespace std;

ifstream in("arbint.in");
ofstream out("arbint.out");

int n, num, m, h[400400], cod, mid, val, hx, l, r, low, high, idx;

void update(int st, int dr, int pos){
	if(st == dr){
		h[pos] = num;
		return;
	} 
	mid = st + (dr-st)/2;
	if(idx <= mid) update(st, mid, 2*pos);
	else update(mid+1, dr, 2*pos+1);
	h[pos] = max(h[2*pos], h[2*pos+1]);
}

int ans(int st, int dr, int pos){
	if(st >= l && dr <= r){
		return h[pos];
	}
	int mid = st + (dr-st)/2;
	int stinga = 0, dreapta = 0;
	if(l <= mid) stinga = ans(st, mid, 2*pos);
	if(r > mid) dreapta = ans(mid+1, dr, 2*pos+1);
	return max(stinga, dreapta);
}

int main(){
	in >> n >> m;
	for(int i = 1; i <= n; i++){
		in >> num;
		idx = i;
		update(1, n, 1);
	}
	for(int i = 1; i <= m; i++){
		in >> cod >> l >> r;
		if(!cod){
			out << ans(1, n, 1) << '\n';
		} else{
			idx = l;
			num = r;
			update(1, n, 1);
		}
	}
	return 0;
}