Cod sursa(job #1092132)
| Utilizator | Data | 26 ianuarie 2014 16:53:33 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int A[100000], N, M, a, b, mx;
bool o;
void close()
{
fin.close(); fout.close();
}
void citire()
{
fin>>N>>M;
for(int i = 1; i<=N; i++)
{
fin>>A[i];
}
}
main()
{
citire();
for(int i = 1; i<=M; i++)
{
fin>>o>>a>>b;
if(o == 0)
{
mx = a;
for(int j = a; j<= b; j++)
{
if(A[j]>mx) mx = A[j];
}
fout<<mx<<endl;
}
else A[a] = b;
}
close();
}
