Cod sursa(job #1356361)
Utilizator | Data | 23 februarie 2015 13:26:12 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int v[10000],x,y,a,aux,n,m,k,i,j,mx;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=m;i++)
{
f>>a>>x>>y;
if(a==0)
{
mx=0;
for(j=x;j<=y;j++)
if(mx<v[j])mx=v[j];
g<<mx<<' ';
g<<endl;
}
if(a==1)
v[x]=y;
}
return 0;
}