LOJ 数列分块入门3

LOJ 数列分块入门3

题目：

• 链接

题解：

• 对于散块，暴力查找。
• 对于整块，仍然是用二分的思想。找到块中第一个<c的元素.

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define N 1000005
#define inf 0x7fffffff
using namespace std;

struct Blo {int l, r, tag;} blo[N];
int n, num, size;
int a[N], b[N], bel[N];

int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + c - '0'; c = getchar();}
    return x *= f;
}

void build() {
    size = (int)sqrt(n), num = n / size;
    if (n % size) num++;
    for (int i = 1; i <= n; i++) bel[i] = (i - 1) / size + 1;
    for (int i = 1; i <= num; i++) {
        blo[i].l = (i - 1) * size + 1;
        blo[i].r = i * size;
    }
    blo[num].r = n;
    for (int i = 1; i <= num; i++) sort(b + blo[i].l, b + 1 + blo[i].r);
}

void reset1(int x, int l, int r, int c) {
    for (int i = l; i <= r; i++) a[i] += c;
    for (int i = blo[x].l; i <= blo[x].r; i++) b[i] = a[i];
    sort(b + blo[x].l, b + 1 + blo[x].r);
}

void update(int l, int r, int c) {
    if (bel[l] == bel[r]) {reset1(bel[l], l, r, c); return;}
    for (int i = bel[l] + 1; i < bel[r]; i++) blo[i].tag += c;
    reset1(bel[l], l, blo[bel[l]].r, c);
    reset1(bel[r], blo[bel[r]].l, r, c);
}

int reset2(int x, int l, int r, int c) {
    int ans = -inf;
    for (int i = l; i <= r; i++)
        if (a[i] + blo[x].tag < c)
            ans = max(ans, a[i] + blo[x].tag);
    return ans; 
}

int ask(int l, int r, int c) {
    int ans = -inf;
    if (bel[l] == bel[r]) {
        ans = max(ans, reset2(bel[l], l, r, c));
        if (ans == -inf) return -1;
        else return ans; 
    }
    ans = max(ans, reset2(bel[l], l, blo[bel[l]].r, c));
    ans = max(ans, reset2(bel[r], blo[bel[r]].l, r, c)); 
    for (int i = bel[l] + 1; i < bel[r]; i++) {
        int pos = lower_bound(b + blo[i].l, b + 1 + blo[i].r, c - blo[i].tag) - b - 1;
        if (pos >= blo[i].l)
            ans = max(ans, b[pos] + blo[i].tag);
    }
    if (ans == -inf) return -1;
    else return ans;
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        a[i] = read();
        b[i] = a[i];
    }
    build();
    for (int i = 1; i <= n; i++) {
        int op = read(), l = read(), r = read(), c = read();
        if (!op) update(l, r, c);
        else printf("%d\n", ask(l, r, c));
    }
    return 0;
}

转载于:https://www.cnblogs.com/BigYellowDog/p/11242685.html