Cod sursa(job #936700)
Utilizator | Bodnariuc Dan Alexandru dutzul | Data | 8 aprilie 2013 13:44:18 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
#define LE 100666
#include <cmath>
ifstream f("arbint.in");ofstream g("arbint.out");
int aa,x,val,n,m,le,i,a[LE],typ,bb;
int result;
int main()
{
f>>n>>m;
for(i=1;i<=n;++i) f>>a[i];
for(i=1;i<=m;++i)
{
f>>typ;
if (typ==0)
{
f>>aa>>bb;
result=0;
for(int j=aa;j<=bb;++j) result=max(result,a[j]);
g<<result<<'\n';
}
else
{
f>>x>>val;
a[x]=val;
}
}
f.close();g.close();
return 0;
}