Cod sursa(job #1848336)
| Utilizator | Data | 15 ianuarie 2017 21:16:44 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<fstream>
using namespace std;
#define MAX 100001
int n,m,A[MAX];
ifstream f1("arbint.in");
ofstream f2("arbint.out");
void schimba(int a,int b)
{
A[a]=b;
}
int maxim(int a,int b)
{
int i,valmax;
valmax=A[a];
for(i=a+1;i<=b;i++)
if(valmax<A[i])
valmax=A[i];
f2<<valmax<<'\n';
}
int main()
{
int x,a,b;
f1>>n>>m;
int i;
for(i=1;i<=n;i++)
f1>>A[i];
for(i=1;i<=m;i++)
{
f1>>x>>a>>b;
if(x==0)
maxim(a,b);
else
schimba(a,b);
}
}
