Cod sursa(job #1081123)
Utilizator | Data | 13 ianuarie 2014 10:37:04 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("arbint.in");
ofstream fo("arbint.out");
int v[100002],n,m,x,a,b;
int main()
{
fi>>n>>m;
for (int i=1;i<=n;i++)
fi>>v[i];
for (int i=1;i<=m;i++) {
fi>>x>>a>>b;
if (x==0) {
int mx=0;
for (int j=a;j<=b;j++)
if (v[j]>mx)
mx=v[j];
fo<<mx<<'\n';
}
else
v[a]=b;
}
return 0;
}