Cod sursa(job #3200325)
Utilizator | Data | 4 februarie 2024 12:47:06 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <math.h>
#include <algorithm>
#define MAX_N 100001
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
int v[MAX_N], n, m, op, a, b,result;
int main() {
fin>>n>>m;
for (int i = 1; i <= n; i++)
fin>>v[i];
while (m--)
{
fin>>op>>a>>b;
if (op == 0)
{
result=0;
while (a <= b)
result = max(result,v[a++]);
fout<<result<<'\n';
}
if (op == 1)
v[a]=b;
}
return 0;
}