Pagini recente » Cod sursa (job #2936071) | Cod sursa (job #288178) | Cod sursa (job #1264232) | Cod sursa (job #668901) | Cod sursa (job #2245688)
#include <fstream>
#include <cmath>
#define amax(a,b) a=max(a,b)
using namespace std;
ifstream f ("arbint.in");
ofstream g ("arbint.out");
const int nmax=1e5+3;
int n,t,d[1003],v[nmax],caz,a,b;
void precalc()
{
int sq=sqrt(n);
int tp=sq+(sq*sq!=n);
for(int i=1;i<=tp;++i)
{
for(int j=(i-1)*sq+1;j<=min(n,i*sq);++j) amax(d[i],v[j]);
}
}
void change(int a,int b)
{
v[a]=b;
int sq=sqrt(n);
int poz=a/sq-(a%sq==0);
d[poz]=0;
for(int i=(poz-1)*sq;i<=min(poz*sq,n);++i) amax(d[poz],v[i]);
}
int solve(int a,int b)
{
int sol=0;
if(b-a<=sqrt(n)+2)
{
for(int i=a;i<=b;++i) amax(sol,v[i]);
return sol;
}
int sq=sqrt(n);
if((a-1)%sq)
{
int t=(a-1)/sq;
for(int i=t*sq;i<=a-1;++i) amax(sol,v[i]);
a=t*sq+1;
}
if(b!=n&&b%sq)
{
int t=b/sq;
for(int i=t*sq;i<=b;++i) amax(sol,v[i]);
}
if(a>b) return sol;
a=a/sq+1;
if(b==n) b=sq+(sq*sq!=n);
for(int i=a;i<=b;++i) amax(sol,d[i]);
return sol;
}
int main()
{
ios::sync_with_stdio(false);
f>>n>>t;
for(int i=1;i<=n;++i) f>>v[i];
precalc();
while(t--)
{
f>>caz>>a>>b;
if(caz==0) g<<solve(a,b)<<'\n';
else change(a,b);
}
return 0;
}