Cod sursa(job #3364041)
| Utilizator | Data | 27 august 2026 19:52:11 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
#define ll long long
ifstream fin('arbint.in');
ofstream fout('arbint.out');
int main() {
ll n, m, v[1005];
fin>>n>>m;
for (ll i = 0;i < n;i++) fin>>v[i];
for (ll i = 0;i < m;i++)
{
ll c, a, b;
fin>>c>>a>>b;
if (c == 0)
{
ll maxim = 0;
for (ll j = a-1;j <= b-1;j++)
if (v[j] >= maxim)
maxim = v[j];
fout<<maxim<<endl;
}
if (c == 1)
{
v[a-1] = b;
}
}
return 0;
}
