Pagini recente » Cod sursa (job #3036363) | Cod sursa (job #2309478) | Cod sursa (job #2558009) | Cod sursa (job #1822257) | Cod sursa (job #1158441)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n,m,i,a[100000];
int maxim_int(int xx, int yy)
{
int maxi=-1;
for(i=xx; i<=yy; i++)
if(a[i]>maxi) maxi=a[i];
return maxi;
}
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
f>>a[i];
while(m)
{
int x, y, care;
f>>care>>x>>y;
if(care)
{
a[x]=y;
}
else g<<maxim_int(x,y)<<'\n';
m--;
}
return 0;
}