Pagini recente » Profil M@2Te4i | Istoria paginii runda/test123456/clasament | Cod sursa (job #1039714) | Istoria paginii runda/ret2 | Cod sursa (job #2275460)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
///*const*/ int n=10;//cin >> n;//int A[n];
int N, M;
ifstream fin("arbint.in"); ofstream fout("arbint.out");
fin >> N >> M;
int A[100001];
for (int i = 1; i <= N; i++)
fin >> A[i];
for (int i = 0; i < M; i++)
{
int op, val1, val2;
fin >> op >> val1 >> val2;;
if (op == 0)
{
int max = A[val1];
for (int j = val1 + 1; j <= val2; j++)
if (max < A[j])
max = A[j];
fout << max<<endl;
}
else
{
A[val1] = A[val2];
}
}
}