Pagini recente » Cod sursa (job #2283491) | Cod sursa (job #2853555) | Cod sursa (job #1572350) | Cod sursa (job #2220979) | Cod sursa (job #1607560)
#include<iostream>
#include<fstream>
using namespace std;
void inter(int &a, int b)
{
a=b;
}
void maxim(int v[100001], int i, int j, int &d)
{
int k;
d=0;
for(k=i;k<=j;k++)
{
if(v[k]>d)
{
d=v[k];
}
}
}
int main()
{
int i,j,k,l,v[100001],N,M,d;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
fin>>N>>M;
for(i=1;i<=N;i++)
{
fin>>v[i];
}
for(l=1;l<=M;l++)
{
fin>>k>>i>>j;
if(k==1)
{
inter(v[i],j);
}
else
{
if(k==0)
{
maxim(v,i,j,d);
fout<<d<<'\n';
}
}
}
fin.close();
fout.close();
return 0;
}