Cod sursa(job #2937843)
Utilizator | Data | 11 noiembrie 2022 10:34:51 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,M,i,k,x,y,C,maxim,v[100100];
int main () {
fin>>n>>M;
for (i=1;i<=n;i++) {
fin>>v[i];
}
for (k=1;k<=M;k++) {
fin>>C>>x>>y;
if (C==1) {
v[x]=y;
}
else {
maxim=v[x];
for (i=x+1;i<=y;i++) {
if (v[i]>maxim)
maxim=v[i];
}
fout<<maxim<<"\n";
}
}
}