Cod sursa(job #1318186)

Utilizator GrandmasterSoucup Bogdan Grandmaster Data 15 ianuarie 2015 18:43:19
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <limits>
#include <sstream>
#include <deque>
#include <bitset>
#include <complex>
#include <functional>
#include <memory>
#include <numeric>
#define x first
#define y second
typedef std::pair<int, int> pii;

using namespace std;

int x[100002], v[100002][2];

int main () {
	ifstream fin("arbint.in");
	ofstream fout("arbint.out");
	int n, m, bit, a, b, bec = 0, ma;
	fin >> n >> m;
	for(int i = 0; i < n; i++)
		fin >> x[i];
	for(int i = 0; i < m; i++)
	{
		fin >> bit >> a >> b;
		if(bit == 1)
		{
			x[a - 1] = x[b - 1];
		}
		else
		{
			ma = -1000000;
			for(int j = a - 1; j <= b - 1; j++)
			{
				if(ma < x[j])
					ma = x[j];
			}
			fout << ma << "\n";
		}	
	}
	return 0;
}