Cod sursa(job #1342956)
Utilizator | Data | 14 februarie 2015 18:22:50 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
int main()
{
int n,m,i,x,a,b,max=0,j;
long v[100001];
cin>>n>>m;
for(i=1;i<=n;++i) cin>>v[i];
for(i=1;i<=m;++i)
{
cin>>x>>a>>b;
if(x==0)
{
for(j=a;j<=b;++j) if( max<v[j]) max=v[j];
cout<<max<<endl;max=0;
}
else if(x==1)
v[a]=v[b];
}
}