Cod sursa(job #2740193)
Utilizator | Data | 11 aprilie 2021 22:02:14 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int main(){
int n,m;
in>>n>>m;
vector<int> v;
for(int i=0;i<n;i++){
int nr;
in>>nr;
v.push_back(nr);
}
for(int i=0;i<m;i++){
int a,b,c;
in>>c>>a>>b;
a--;
if(c==0){out<<*max_element(v.begin()+a,v.begin()+b)<<"\n";}
else v[a]=b;
}
}