Cod sursa(job #1864765)
| Utilizator | Data | 31 ianuarie 2017 23:38:18 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#define N 100010
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int v[N],i,j,m,k,t,max1,p,r,x,n,y,z;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
}
while(k!=0)
{
max1=-13;
f>>x;
if(x==0)
{
f>>y>>z;
for(i=y;i<=z;i++)
max1=max(v[i],max1);
g<<max1<<"\n";
}
else
{
f>>y>>z;
v[y]=z;
}
k--;
}
}
