Codeforces Round #292 (Div. 1) C - Drazil and Park

C - Drazil and Park

每个点有两个值Li 和 Bi，求Li + Rj (i < j) 的最大值，这个可以用线段树巧妙的维护。。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PII pair<int, int>
#define y1 skldjfskldjg
#define y2 skldfjsklejg

using namespace std;

const int N = 2e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;

int n, m;
LL d[N], h[N], sum[N];

struct node {
    LL mx1, mx2, mx3;
    node operator + (const node &rhs) const {
        node ans;
        ans.mx1 = max(mx1, rhs.mx1);
        ans.mx2 = max(mx2, rhs.mx2);
        ans.mx3 = max(mx3, rhs.mx3);
        ans.mx3 = max(ans.mx3, mx1 + rhs.mx2);
        return ans;
    }
} a[N << ];

void build(int l, int r, int rt) {
    if(l == r) {
        a[rt].mx1 =  * h[l] - sum[l - ];
        a[rt].mx2 =  * h[l] + sum[l - ];
        a[rt].mx3 = -INF;
        return;
    }
    int mid = l + r >> ;
    build(l, mid, rt << );
    build(mid + , r, rt <<  | );
    a[rt] = a[rt << ] + a[rt <<  | ];
}

node query(int L, int R, int l, int r, int rt) {
    if(l >= L && r <= R) return a[rt];
    int mid = l + r >> ;
    if(R <= mid) return query(L, R, l, mid, rt << );
    if(L > mid) return query(L, R, mid + , r, rt <<  | );
    return query(L, R, l, mid, rt << ) + query(L, R, mid + , r, rt <<  | );
}

int main() {
    scanf("%d%d", &n, &m);
    for(int i = ; i <= n; i++) scanf("%lld", &d[i]), d[i + n] = d[i];
    for(int i = ; i <= n; i++) scanf("%lld", &h[i]), h[i + n] = h[i];
    for(int i = ; i <=  * n; i++) sum[i] = sum[i - ] + d[i];
    build(,  * n, );

    while(m--) {
        int L, R; scanf("%d%d", &L, &R);
        L--, R--;
        L = (L -  + n) % n;
        R = (R + ) % n;
        L++, R++;
        swap(L, R);
        if(L > R) R += n;
        printf("%lld\n", query(L, R, ,  * n, ).mx3);
    }
    return ;
}

/*
*/