Cod sursa(job #2868560)

Utilizator Mihai7218Bratu Mihai-Alexandru Mihai7218 Data 11 martie 2022 00:08:48
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, i, j, m, x, op, y;
vector <int> t;
void update(int s, int a, int b, int poz, int val)
{
	if (a == b)
	{
		t[s] = val;
		return;
	}
	int m = (a + b) / 2, ps = 2 * s, pd = 2 * s + 1;
	if (poz <= m)
		update(ps, a, m, poz, val);
	else
		update(pd, m + 1, b, poz, val);
	t[s] = max(t[ps], t[pd]);
}
int query(int s, int st, int dr, int a, int b)
{
	if (a <= st && dr <= b)
		return t[s];
	int m = (st + dr) / 2, ps = 2 * s, pd = 2 * s + 1, rs = -2e8, rd = -2e8;
	if (a <= m)
		rs = query(ps, st, m, a, b);
	if (b >= m + 1)
		rd = query(pd, m + 1, dr, a, b);
	return max(rs, rd);
}
int main()
{
	fin >> n >> m; t.resize(4 * n + 1);
	for (i = 1; i <= n; i++)
	{
		fin >> x;
		update(1, 1, n, i, x);
	}
	for (i = 1; i <= m; i++)
	{
		fin >> op >> x >> y;
		if (op == 0)
			fout << query(1, 1, n, x, y) << "\n";
		else
			update(1, 1, n, x, y);
	}
}