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