Cod sursa(job #2245763)

Utilizator usureluflorianUsurelu Florian-Robert usureluflorian Data 25 septembrie 2018 20:04:32
Problema Arbori de intervale Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb
#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=1e6+3;
int n,t,d[nmax],v[nmax],caz,a,b,sq,st[nmax],dr[nmax];
void precalc()
{
    int tp=n/sq+(sq*sq!=n);
    for(int i=0;i<tp;++i)
    {
        for(int j=i*sq+1;j<=min(n,(i+1)*sq);++j)
        {
            amax(d[i],v[j]);
            st[j]=i*sq;
            dr[j]=min(n,(i+1)*sq);
        }
    }
}
void change(int a,int b)
{
    v[a]=b;
    int poz=st[a]/sq;
    if(st[a]==a) --a;
    d[poz]=0;
    for(int i=st[a]+1;i<=dr[a];++i) amax(d[poz],v[i]);
}
int solve(int a,int b)
{
    int sol=0;
    if(b-a<=sq)
    {
        for(int i=a;i<=b;++i) amax(sol,v[i]);
        return sol;
    }
    for(int i=a;i<=dr[a];++i) amax(sol,v[i]);
    for(int i=b;i>=st[b];--i) amax(sol,v[i]);
    a=dr[a]/sq;
    b=st[b]/sq;
    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];
    sq=sqrt(n);
    precalc();
    while(t--)
    {
        f>>caz>>a>>b;
        if(caz==0) g<<solve(a,b)<<'\n';
        else change(a,b);
    }
    return 0;
}