Cod sursa(job #2863882)
Utilizator | Data | 7 martie 2022 12:56:28 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int main(){
int n, m, a[100001], x, y, z;
fin>>n>>m;
for(int i=1;i<=n;i++){
fin>>a[i];
}
while(m--){
fin>>z>>x>>y;
if(z==0){
int ma=0;
for(int k=x;k<=y;k++){
ma = max(ma, a[k]);
}
fout<<ma<<'\n';
}else{
a[x] = y;
}
}
return 0;
}