Cod sursa(job #1624689)

Utilizator AeroHHorea Stefan AeroH Data 2 martie 2016 13:00:47
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#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<<1,l,(l+r)>>1),Q((p<<1)+1,((l+r)>>1)+1,r));
}

int main()
{
f>>n>>m;
while(t<n)t<<=1;
for (i=t;i<n+t;++i)f>>A[i];
for(i=t-1;i;--i)A[i]=max(A[i<<1],A[(i<<1)+1]);
while(m--)
{
    f>>q>>a>>b;
    if (q)
    {
        a+=t-1,A[a]=b;
        while(a>>=1)A[a]=max(A[a<<1],A[(a<<1)+1]);
    }
    else g<<Q(1,1,t)<<'\n';
}
return 0;
}