Pagini recente » Cod sursa (job #17120) | Cod sursa (job #2122439) | Cod sursa (job #2868510) | Cod sursa (job #496610) | Cod sursa (job #2753812)
#include <fstream>
using namespace std;
ifstream F ("arbint.in");
ofstream G ("arbint.out");
int m, nr, n, a, b, v[100001];
int maxim(int a, int b)
{
int Max = -1;
for(int i = a - 1; i < b; i++)
if (v[i] > Max)
Max = v[i];
return Max;
}
void schimbare(int a, int b)
{
v[a - 1] = b;
}
int main()
{
F>>n>>m;
for(int i = 0; i < n; i++)
F>>v[i];
for(int i = 0; i < m; i++)
{
F>>nr>>a>>b;
if(nr == 0)
G<<maxim(a,b)<<endl;
else
schimbare(a,b);
}
return 0;
}