Cod sursa(job #3357738)
| Utilizator | Data | 13 iunie 2026 13:32:05 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int A[100010];
int main()
{
int n,m;
cin>>n>>m;
for (int i=1; i<=n; i++){
cin>>A[i];
}
for (int i=1; i<=m; i++){
int x, a, b;
cin>>x>>a>>b;
if (x==0){
cout<<*max_element(A+a, A+b+1)<<'\n';
}
else{
A[a]=b;
}
}
return 0;
}