Cod sursa(job #2326016)

Utilizator refugiatBoni Daniel Stefan refugiat Data 23 ianuarie 2019 11:56:49
Problema SequenceQuery Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.34 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream si("sequencequery.in");
ofstream so("sequencequery.out");
int x,n,m,a,b;
long smax,s;
struct str{
    long x;
    long y;
    long z;
    long w;
};
str aint[400010];

void build(int nod,int st,int dr){
    if(st==dr){
        si>>x;
        aint[nod].x=aint[nod].y=aint[nod].z=aint[nod].w=x;
    }
    else{
        int mid=(st+dr)/2;
        build(2*nod,st,mid);
        build(2*nod+1,mid+1,dr);
        aint[nod].x=aint[2*nod].x+aint[2*nod+1].x;
        aint[nod].y=max(aint[2*nod].y,aint[2*nod].x+aint[2*nod+1].y);
        aint[nod].z=max(aint[2*nod+1].z,aint[2*nod].z+aint[2*nod+1].x);
        aint[nod].w=max(max(aint[2*nod].w,aint[2*nod+1].w),aint[2*nod].z+aint[2*nod+1].y);
    }

}

void querry(int nod,int st,int dr,int a,int b){
    if(a<=st&&b>=dr){
        smax=max(smax, max(aint[nod].w, aint[nod].y+s));
        s=max(s+aint[nod].x, aint[nod].z);
        smax=max(smax,s);
    }
    else{
        int mid=(st+dr)/2;
        if(a<=mid)
            querry(2*nod,st,mid,a,b);
        if(b>mid)
            querry(2*nod+1,mid+1,dr,a,b);
    }
}
int main()
{
    si>>n>>m;
    build(1,1,n);
    for(int i=1;i<=m;i++){
        si>>a>>b;
        smax=s=-2000000000;
        querry(1,1,n,a,b);
        so<<smax<<'\n';
    }
    return 0;
}