Cod sursa(job #1163051)
Utilizator | Data | 1 aprilie 2014 09:44:50 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n, m, v[100001], a, b, t, m1;
int main(){
ifstream f("arbint.in");
ofstream g("arbint.out");
f>>n>>m;
for(int i=1;i<=n;i++)
f>>v[i];
while(m--){
f>>t>>a>>b;
if(t)v[a]=b;
else{
m1=v[a];
for(int i=a;i<=b;i++)
m1=max(v[i], m1);
g<<m1<<"\n";
cout<<m1<<"\n";
}
}
return 0;
}