Cod sursa(job #1623046)
Utilizator | Data | 1 martie 2016 16:47:13 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int main()
{
int n,op,v[100100],i;
ifstream f("arbint.in");
ofstream fout("arbint.out");
f>>n;
f>>op;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=op;i++)
{
int tip,a,b;
f>>tip;
f>>a;
f>>b;
if(tip==0)
{
int max=v[a];
for(int j=a;j<=b;j++)
if(max<v[j])
max=v[j];
fout<<max<<'\n';
}
else {v[a]=b;}
}
return 0;
}