Cod sursa(job #164270)
| Utilizator | Data | 23 martie 2008 20:30:12 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int main()
{long n,m,i,j,a[1000001],x,max,y;
int r;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(j=1;j<=m;j++)
{fin>>r;
if(r==0) {fin>>x>>y;
max=-1;
for(i=x;i<=y;i++)
if(a[i]>max)max=a[i];
fout<<max<<endl;
}
else {fin>>x>>y;
a[x]=a[y];
}
}
fin.close();
fout.close();
return 0;
}