Cod sursa(job #1798996)
| Utilizator | Data | 5 noiembrie 2016 17:28:08 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <vector>
#include <fstream>
#include <algorithm>
//#include <iostream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
vector <int> a;
void read(int &x)
{
int n;
cin >> n >> x;
a.resize(n);
for (int i=0; i<a.size(); i++)
{
cin >> a[i];
}
}
main()
{
int m,o,x,y;
read(m);
for (; m; m--)
{
cin >> o >> x >> y;
if (o==1) a[x-1]=y;
else cout << *max_element(a.begin()+x-1,a.end()+y-a.size()) << '\n';
}
}
