Cod sursa(job #1570603)
Utilizator | Data | 16 ianuarie 2016 17:48:54 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int n,m,i,j,v[100001],maxim,x,a,b;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
int main (){
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>v[i];
for (i=1;i<=m;i++){
fin>>x>>a>>b;
if (x == 1)
v[a] = v[b];
else {
maxim = 0;
for (j=a;j<=b;j++)
if (v[j] > maxim)
maxim = v[j];
fout<<maxim<<"\n";
}
}
return 0;
}