Pagini recente » Cod sursa (job #797375) | Cod sursa (job #2470186) | Cod sursa (job #2163431) | Cod sursa (job #2784644) | Cod sursa (job #2637478)
#include <fstream>
using namespace std;
ifstream fin("sequencequery.in");
ofstream fout("sequencequery.out");
struct el
{
long long m, sum, s, p;
} a[200001];
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;
}