UVA 1400 "Ray, Pass me the dishes!" （线段树）

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68200#problem/J

 

题意：给一个长度为n的整数数列，然后给m个询问，对于每个询问(a, b)给出该区间内最大子序列之和的两个下标

 

思路：询问次数很多，故需要线段树来维护三个值：max_sub，max_prefix，max_suffix，由于所要查询的区间的两个最大子序列下标可能会因为父节点分成两部分，对于某区间的max_sub(l, r)分情况讨论：

1.起点和终点都在左区间，则max_sub(l, r) = max(l, mid)

2.起点和终点都在右区间，则max_sub(l, r) = max(mid + 1, r)

3.一左一右，则max_sub(l, r) = (max_suffix(l, mid), max_prefix(mid + 1, r)) ，max_suffix(l, mid)找出了该区间左端最优位置，max_prefix(mid + 1, r)找到了右端最优位置

 

 

#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <utility>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <climits>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment (linker, "/STACK:1024000000,1024000000")

typedef long long ll;

using namespace std;

const int maxn = 500050;

ll s[maxn];

struct node
{
    int x, y;
    int pre, suf;
} t[maxn << 2];

void pushup(int l, int r, int rt)
{
    if (s[t[rt << 1].pre] - s[l - 1] >= s[t[rt << 1 | 1].pre] - s[l - 1])      //维护最大前缀和
        t[rt].pre = t[rt << 1].pre;
    else
        t[rt].pre = t[rt << 1 | 1].pre;

    if (s[r] - s[t[rt << 1].suf - 1] >= s[r] - s[t[rt << 1 | 1].suf - 1])     //维护最大后缀和
        t[rt].suf = t[rt << 1].suf;
    else
        t[rt].suf = t[rt << 1 | 1].suf;

    ll le = s[t[rt << 1].y] - s[t[rt << 1].x - 1];                          //分别对应情况1,2,3
    ll ri = s[t[rt << 1 | 1].y] - s[t[rt << 1 | 1].x - 1];
    ll mid = s[t[rt << 1 | 1].pre] - s[t[rt << 1].suf - 1];

    if (le >= ri)
    {
        t[rt].x = t[rt << 1].x;
        t[rt].y = t[rt << 1].y;
    }
    else
    {
        t[rt].x = t[rt << 1 | 1].x;
        t[rt].y = t[rt << 1 | 1].y;
    }

    if (mid > s[t[rt].y] - s[t[rt].x - 1])
    {
        t[rt].x = t[rt << 1].suf;
        t[rt].y = t[rt << 1 | 1].pre;
    }
    if (mid == s[t[rt].y] - s[t[rt].x - 1])
    {
        if (t[rt << 1].suf < t[rt].x)
        {
            t[rt].x = t[rt << 1].suf;
            t[rt].y = t[rt << 1 | 1].pre;
        }
        else if (t[rt << 1].suf == t[rt].x && t[rt << 1 | 1].pre < t[rt].y)
        {
            t[rt].y = t[rt << 1 | 1].pre;
        }
    }
}

void build(int l, int r, int rt)
{
    if (l == r)
    {
        t[rt].pre = t[rt].suf = l;
        t[rt].x = t[rt].y = l;
        // printf("%d %d %d\n", l, r, rt);
        return ;
    }
    int mid = (l + r) / 2;
    build(lson);
    build(rson);
    pushup(l, r, rt);
}

node query(int ql, int qr, int l, int r, int rt)
{
    if (ql <= t[rt].x && qr >= t[rt].y)
        return t[rt];

    //    printf("%d %d %d\n", l, r, rt);
    int mid = (l + r) / 2;
    if (qr <= mid)
         return query(ql, qr, lson);
    if (ql > mid)
         return query(ql, qr, rson);

    node res;
    node le = query(ql, qr, lson);
    node ri = query(ql, qr, rson);

    if (s[le.pre] - s[l - 1] >= s[ri.pre] - s[l - 1])
        res.pre = le.pre;
    else
        res.pre = ri.pre;
    if (s[r] - s[le.suf - 1] >= s[r] - s[ri.suf - 1])
        res.suf = le.suf;
    else
        res.suf = ri.suf;

    if (s[le.y] - s[le.x - 1] >= s[ri.y] - s[ri.x - 1])
        res.x = le.x, res.y = le.y;
    else
        res.x = ri.x, res.y = ri.y;

    if (s[ri.pre] - s[le.suf - 1] > s[res.y] - s[res.x - 1])
    {
        res.x = le.suf, res.y = ri.pre;
    }
    if (s[ri.pre] - s[le.suf - 1] == s[res.y] - s[res.x - 1])
    {
        if (le.suf < res.x)
        {
            res.x = le.suf;
            res.y = ri.pre;
        }
        else if (le.suf == res.x && ri.pre < res.y)
        {
            res.y = ri.pre;
        }
    }
    return res;
}

int main()
{
    int n, m, ca = 1;
    while (~scanf("%d%d", &n, &m))
    {
        memset(s, 0, sizeof(s));
        for (int i = 1; i <= n; i++)
        {
            int num;
            scanf("%d", &num);
            s[i] = s[i - 1] + num;
        }
        build(1, n, 1);
        printf("Case %d:\n", ca++);
        for (int i = 1; i <= m; i++)
        {
            int ql, qr;
            scanf("%d%d", &ql, &qr);
            node res = query(ql, qr, 1, n, 1);
            printf("%d %d\n", res.x, res.y);
        }
    }
    return 0;
}