Pagini recente » Cod sursa (job #1793830) | Borderou de evaluare (job #1299654) | Cod sursa (job #1599531) | Cod sursa (job #2649614) | Cod sursa (job #544169)
Cod sursa(job #544169)
#include <algorithm>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream in("arbint.in");
ofstream out("arbint.out");
int N, M;
in >> N >> M;
vector<int> v(N + 1);
for (int i = 1; i <= N; i++)
in >> v[i];
for (int i = 1; i <= M; i++)
{
int t, a, b;
in >> t >> a >> b;
if (t == 0)
{
out << *max_element(v.begin() + a, v.begin() + b + 1) << '\n';
}
else
{
v[a] = b;
}
}
}