Cod sursa(job #2755278)
| Utilizator | Data | 26 mai 2021 22:34:28 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int arb[100001];
int main()
{
int n,m,op,x,y,val,maxim=INT_MIN;
fin >> n >> m;
for(int i=1; i<=n; i++)
{
fin >> val;
arb[i] = val;
}
for(int i=1; i<=m; i++)
{
maxim=INT_MIN;
fin >> op >> x >> y;
if(op == 0)
{
for(int j=x; j<=y; j++)
{
if(arb[j] > maxim)
{
maxim = arb[j];
}
}
fout<<maxim << '\n';
}
else if(op == 1)
{
arb[x] = y;
}
}
return 0;
}
