Cod sursa(job #1096653)
| Utilizator | Data | 2 februarie 2014 14:37:07 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n,v[10000],m,i,a,b,x,j,maxim;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=m;i++)
{
maxim=0;
f>>x>>a>>b;
if(x==0)
{
for(j=a;j<=b;j++)
{
if(v[j]>maxim)
{
maxim=v[j];
}
}
g<<maxim<<'\n';
}
else v[a]=b;
}
return 0;
f.close();
g.close();
}
