Cod sursa(job #1874553)
Utilizator | Data | 10 februarie 2017 10:29:58 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
#define dim 100001
int c[dim],n,m,x,a,b,maxim;
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
in>>c[i];
}
for(int i=1;i<=m;i++)
{
in>>x>>a>>b;
if(x==0)
{
maxim=-1;
for(int j=a;j<=b;j++)
if(maxim<c[j]) maxim=c[j];
out<<maxim<<'\n';
}
else
{
c[a]=b;
}
}
}