Cod sursa(job #1004748)
Utilizator | Data | 3 octombrie 2013 16:56:24 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int v[100001],n,m,a,b,ct,i;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=m;i++)
{f>>ct;
if(ct==0)
{f>>a>>b;
g<<*max_element(&v[a],&v[b+1])<<'\n';}
if(ct==1)
{f>>a>>b;
v[a]=b;}}
f.close();
g.close();
return 0;
}