Cod sursa(job #1036418)
Utilizator | Data | 19 noiembrie 2013 12:57:52 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
int maxd(int a,int b,int V[]){
int max=V[a];
for(int i=a+1;i<=b;i++){
if(V[i]>max){
max=V[i];
}
}
return max;
}
int main(){
ifstream f("arbint.in");
ofstream o("arbint.out");
int n=0;f>>n;
int m=0;f>>m;
int V[100000];
for(int i=1;i<=n;i++){
f>>V[i];
}
for(int i=0;i<m;i++){
int x=0;f>>x;
int a,b;f>>a>>b;
if(x==0){
o<<maxd(a,b,V)<<'\n';
}else{
V[a]=b;
}
}
return 0;
}