Cod sursa(job #2132323)
Utilizator | Data | 15 februarie 2018 18:11:05 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
using namespace std;
int main()
{
int a,b,opert,N,M,A[10000],z,x,c,Maxim;Maxim = -1;
cin>>N;
cin>>M;
for(z = 1; z <= N; z++)
{
cin>>A[z];
}
for(c = 1; c <= M; c++)
{
cin>>opert>>a>>b;
if(opert == 0)
{
for(z = a; z <= b;z++)
{
if(A[z] > Maxim)
{
Maxim = A[z];
}
}
}
if(opert == 1)
{
A[a] = A[b];
}
}
cout<<Maxim<<endl;
return 0;
}