Cod sursa(job #2842472)
Utilizator | Albu Victor albu | Data | 31 ianuarie 2022 21:28:35 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
const int NMAX=100002;
int v[NMAX];
int n,m;
int c,b,a;
int functie(int a ,int b)
{
int ans=0;
for(int i=a;i<=b;i++)
ans=max(ans,v[i]);
return ans;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>v[i];
while(m)
{
cin>>c>>a>>b;
if(c==1)v[a]=b;
else cout<<functie(a,b)<<'\n';
m--;
}
return 0;
}