Cod sursa(job #455790)
Utilizator | Szabo Krisztian k_killer | Data | 14 mai 2010 11:04:27 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int main(){
ifstream fin;
ofstream fout;
fin.open("arbint.in");
fout.open("arbint.out");
int n, m, max;
int op, a, b;
long v[100000];
fin >> n >> m;
for (int i=0; i<n; i++)
fin >> v[i];
while (m--){
fin >> op >> a >> b;
if (op == 0){
max = v[a];
for (int i=a; i<=b; i++)
if (v[i] > max)
max = v[i];
fout << max << endl;
}
else{
v[a] = b;
}
}
return 0;
}