Cod sursa(job #1825242)
Utilizator | Data | 8 decembrie 2016 21:24:06 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, v[100000], x, a, b;
fin >> n >> m;
for(int i=1;i<=n;i++) fin >> v[i];
while(m)
{
fin >> x >> a >> b;
if(x==0)
{
int maxim=v[a];
for(int i=a+1;i<=b;i++)
{
if(v[i]>maxim) maxim=v[i];
}
fout << maxim << "\n";
}
else
{
v[a]=b;
}
m--;
}
return 0;
}