Cod sursa(job #3200304)
| Utilizator | Data | 4 februarie 2024 12:21:07 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#define NMAX 100001
using namespace std;
int v[NMAX],n,m,a,b,operatie,maxi;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=m;i++)
{
fin>>operatie>>a>>b;
if(operatie==1)
v[a]=b;
else
{
maxi=0;
while(a<=b)
{
if(v[a]>maxi)
maxi=v[a];
a++;
}
fout<<maxi<<'\n';
}
}
return 0;
}
