Cod sursa(job #2405934)
| Utilizator | Data | 15 aprilie 2019 10:36:30 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, v[100000005];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
{
int x;
fin >> x;
v[i] = x;
}
for(int i = 1; i <= m; i++)
{
bool op;
int a, b;
fin >> op >> a >> b;
if(op)
{
v[a] = b;
}
else
{
cout << *max_element(v + a, v + b + 1) << "\n";
}
}
return 0;
}
