Pagini recente » Cod sursa (job #2608749) | Cod sursa (job #729188) | Monitorul de evaluare | Cod sursa (job #2186218) | Cod sursa (job #2605822)
#include <fstream>
#define MAX 100005
using namespace std;
ifstream fin ("arbint.in");
ofstream fout("arbint.out");
int main() {
int arr[MAX], n, m;
fin >> n >> m;
for (int i = 1;i <= n;i ++)
fin >> arr[i];
int left, right, operation;
for (int i = 1;i <= m;i ++) {
fin >> operation >> left >> right;
if (operation == 0) {
int max = arr[left];
for (int j = left + 1;j <= right;j ++)
if (max < arr[j])
max = arr[j];
fout << max << '\n';
} else {
arr[left] = right;
}
}
return 0;
}