Cod sursa(job #2637141)

Utilizator popoviciAna16Popovici Ana popoviciAna16 Data 21 iulie 2020 15:05:47
Problema SequenceQuery Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.21 kb
#include <fstream>
using namespace std;

ifstream fin("sequencequery.in");
ofstream fout("sequencequery.out");

struct el
{
    long long m, sum, s, p;
} a[400001];

int poz, val, qst, qdr;

el comb(el a, el b)
{
    el c;
    c.m = max(max(a.m, b.m), a.s + b.p);
    c.sum = a.sum + b.sum;
    c.s = max(b.s, b.sum + a.s);
    c.p = max(a.p, a.sum + b.p);
    return c;
}

void constr(int nod, int st, int dr)
{
    if (st == dr)
    {
        fin >> a[nod].m;
        a[nod].sum = a[nod].s = a[nod].p = a[nod].m;
    }
    else
    {
        int mij = (st+dr)>>1;
        constr(nod<<1, st, mij);
        constr(nod<<1|1, mij+1, dr);
        a[nod] = comb(a[nod<<1], a[nod<<1|1]);
    }
}

el query(int nod, int st, int dr)
{
    if (qst <= st && dr <= qdr)
        return a[nod];
    int mij = (st+dr)>>1;
    el eins, zwei;
    eins = zwei = {-(1ll<<60), 0, -(1ll<<60), -(1ll<<60)};
    if (qst <= mij)
        eins = query(nod<<1, st, mij);
    if (mij < qdr)
        zwei = query(nod<<1|1, mij+1, dr);
    return comb(eins, zwei);
}

int main()
{
    int n, i, q;
    fin >> n >> q;
    constr(1, 1, n);
    for (i = 1; i<=q; i++)
    {
        fin >> qst >> qdr;
        fout << query(1, 1, n).m << '\n';
    }
    return 0;
}