Cod sursa(job #3358433)
| Utilizator | Data | 16 iunie 2026 18:38:30 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m;
int v[100001];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>v[i];
while(m--)
{
int op,a,b;
fin>>op>>a>>b;
if(op==0)
{
int mx=v[a];
for(int i=a+1; i<=b; i++)
if(v[i]>mx)
mx=v[i];
fout<<mx<<"\n";
}
else
v[a]=b;
}
return 0;
}
