Cod sursa(job #2988737)
Utilizator | Data | 5 martie 2023 13:51:03 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
#define MAX 100000
int v[MAX+1];
int cerinta1(int ve[MAX+1], int a, int b)
{
int i,maxi=0;
for(i=a; i<=b; i++)
{
if(ve[i]>maxi)
maxi=ve[i];
}
return maxi;
}
int main()
{
int n,m,i,op,a,b,aux;
in>>n>>m;
for(i=1; i<=n; i++)
in>>v[i];
for(i=0; i<m; i++)
{
in>>op>>a>>b;
if(op==0)
out<<cerinta1(v,a,b)<<endl;
else
v[a]=b;
}
return 0;
}