Cod sursa(job #1580271)
| Utilizator | Data | 25 ianuarie 2016 18:48:20 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m,x,y,z,i,j,v[100003],a,b,maxim;
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
fin>>v[i];
}
for(i=1;i<=m;i++){
fin>>x;
fin>>a;
fin>>b;
if(x==1){
v[a]=b;
}
else{
maxim=-1;
for(j=a;j<=b;j++){
if(v[j]>maxim){
maxim=v[j];
}
}
fout<<maxim<<"\n";
}
}
return 0;
}
