Cod sursa(job #3030637)
Utilizator | Data | 17 martie 2023 19:29:16 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
#include <vector>
#include <list>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n, m, op, a, b, k;
int sol[50001], v[100001];
int main()
{
f >> n >> m;
for (int i = 1; i <= n; i++)
{
f >> v[i];
}
for (int i = 1; i <= m; i++)
{
f >> op >> a >> b;
if (op == 0)
{
int maxx = 0;
for (int j = a; j <= b; j++)
if (maxx < v[j]) {
maxx = v[j];
sol[++k] = v[j];
}
}
if (op == 1)
{
v[a] = b;
}
}
for (int i = 1; i <= k; i++)
g << sol[i] << '\n';
return 0;
}