Pagini recente » Istoria paginii newsletter/monthly-2012-6 | Borderou de evaluare (job #928707) | Cod sursa (job #3226512) | Borderou de evaluare (job #1012542) | Cod sursa (job #1624700)
#include <bits/stdc++.h>
using namespace std;
string z="arbint.";
ifstream f(z+"in");
ofstream g(z+"out");
int i,j,q,a,b,n,m,t=1,A[400001];
int Q(int p,int l,int r){
if (l>=a&&b>=r)return A[p];
if (l>b||a>r)return 0;
return max(Q(p*2,l,(l+r)/2),Q((p*2)+1,(l+r)/2+1,r));
}
int main()
{
f>>n>>m;
while(t<n)t*=2;
for (i=t;i<n+t;++i)f>>A[i];
for(i=t-1;i;--i)A[i]=max(A[i*2],A[(i*2)+1]);
while(m--)
{
f>>q>>a>>b;
if (q){
a+=t-1,A[a]=b;
while(a/=2)A[a]=max(A[a*2],A[(a*2)+1]);
}
else g<<Q(1,1,t)<<'\n';
}
return 0;
}