Pagini recente » Cod sursa (job #1273254) | Cod sursa (job #848672) | Cod sursa (job #2822328) | Cod sursa (job #2285690) | Cod sursa (job #1724580)
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int i,j,m,n,c,d,e,a[1000];
int maxim(int a[], int d, int e)
{
int maxi=a[d];
for(i=d;i<=e;i++)
if(a[i]>=maxi)
maxi=a[i];
return maxi;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(j=1;j<=m;j++)
{
fin>>c>>d>>e;
if(c==0)
fout<<maxim(a,d,e)<<'\n';
else
a[d]=e;
}
return 0;
}