Pagini recente » Cod sursa (job #240198) | Cod sursa (job #2437840) | Cod sursa (job #1572753) | Cod sursa (job #2121856) | Cod sursa (job #1793844)
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int v[100000];
int main()
{
int o,x,y,aux;
int n,m;
FILE *f=fopen("arbint.in","r");
FILE *g=fopen("arbint.out","w");
fscanf(f,"%d%d",&n,&m);
for(int i=1; i<=n; i++)
fscanf(f,"%d",&v[i]);
for(int iii=1; iii<=m; iii++)
{
fscanf(f,"%d",&o);
if(o==1)
{
fscanf(f,"%d%d",&x,&y);
v[x]=y;
}
else
{
fscanf(f,"%d%d",&x,&y);
aux=*max_element(v+x,v+y+1);
fprintf(g,"%d\n",aux);
}
}
return 0;
}