Cod sursa(job #1041805)
Utilizator | Data | 26 noiembrie 2013 10:03:58 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("arbint.in");
ofstream g("arbint.out");
long long m,n,v[100002],i,a,b,x,max,j;
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=m;i++)
{
f>>x>>a>>b;
if(x==1)
v[a]=b;
else
{
max=v[a];
for( j=a;j<=b;j++)
if(v[j]>max)
max=v[j];
g<<max<<endl;
}
}
return 0;
}