Cod sursa(job #3297423)
Utilizator | Data | 22 mai 2025 16:43:33 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int v[100005];
int main()
{
int n,m,tip,a,b;
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=m;i++)
{
cin>>tip>>a>>b;
if(tip==1)
v[a]=b;
else
{
int maxi=0;
for(int j=a;j<=b;j++)
maxi=max(maxi,v[j]);
cout<<maxi<<"\n";
}
}
return 0;
}