Pagini recente » Istoria paginii utilizator/uptreturn | Borderou de evaluare (job #2463173) | Borderou de evaluare (job #2738779) | Borderou de evaluare (job #724945) | Cod sursa (job #2129781)
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int main()
{int a[100000],max1,n,m,i,j,b,d,c;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=m;i++)
{fin>>c>>b>>d;
if(c==1)
a[b]=a[d];
else
{ max1=0;
for(j=b;j<=d;j++)
if (max1<a[j])
max1=a[j];
fout<<max1<<endl;
} }
return 0;
}