Cod sursa(job #2572375)
Utilizator | Data | 5 martie 2020 12:38:00 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fi("arbint.in");
ofstream fo("arbint.out");
int n,m,i,a,b,c,v[100500],y,maxx;
int main()
{
fi>>n>>m;
for(i=1;i<=n;i++)
{
fi>>v[i];
}
for(i=1;i<=m;i++)
{
fi>>a>>b>>c;
if(a==0)
{
maxx=v[b];
for(y=b;y<=c;y++)
{
if(v[y]>maxx)
{
maxx=v[y];
}
}
fo<<maxx;
}
else
{
v[b]=c;
}
}
return 0;
}