Cod sursa(job #1938024)
Utilizator | Alex Enache Alex18mai | Data | 24 martie 2017 15:46:37 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int A[100010];
int main()
{
int n,m;
cin>>n>>m;
for (int i=1; i<=n; i++){
cin>>A[i];
}
for (int i=1; i<=m; i++){
int x, a, b;
cin>>x>>a>>b;
if (x==0){
int MAX=0;
for (int k=a; k<=b; k++){
if (A[k]>MAX){
MAX=A[k];
}
}
cout<<MAX<<'\n';
}
else{
A[a]=b;
}
}
return 0;
}