Cod sursa(job #1043401)
Utilizator | Data | 28 noiembrie 2013 15:27:52 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
long v[100001];
int n;
int maxim(int x,int y)
{
int i,max=-1;
for(i = x ; i <= y ; i++)
if(v[i] >= max)
max = v[i];
return max;
}
int main()
{
int n,m,i,c,j,a;
long b;
in >> n >> m;
for(i = 1 ; i<= n ; i++)
in >> v[i];
for(j = 1 ; j <= m ; j++)
{
in >> c >> a >> b;
if(c == 0)
out << maxim(a,b) << " ";
else
v[a] = b;
}
return 0;
}