[Luogu] 区间统计Tallest Cow

最新推荐文章于 2022-12-13 23:10:15 发布

weixin_30421809

最新推荐文章于 2022-12-13 23:10:15 发布

阅读量107

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shandongs1/p/8455213.html

本文提供了一种解决洛谷P2879问题的有效方法，采用差分与线段树相结合的技术实现。通过输入处理、节点排序以及更新高度数组等步骤，最终实现了高效查询和更新区间内元素的功能。

https://www.luogu.org/problemnew/show/P2879

差分 | 线段树

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const int N = 1e4 + 10;

#define gc getchar()

struct Node {int l, r;}A[N];
int n, my, Maxh, R;
int H[N];

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

inline bool cmp(Node a, Node b) {
    return a.l == b.l ? a.r < b.r : a.l < b.l;
}

int main() {
    n = read();
    my = read();
    Maxh = read();
    R = read();
    for(int i = 1; i <= R; i ++) {
        int one = read(), tow = read();
        A[i].l = min(one, tow);
        A[i].r = max(one, tow);
    }
    sort(A + 1, A + R + 1, cmp);
    H[A[1].l + 1] += 1;
    H[A[1].r] -= 1;
    for(int i = 2; i <= R; i ++) {
        if(A[i].l == A[i - 1].l && A[i].r == A[i - 1].r) continue ;
        H[A[i].l + 1] += 1;
        H[A[i].r] -= 1;
    }
    int tmp = 0;
    for(int i = 1; i <= n; i ++) {
        tmp += H[i];
        cout << Maxh - tmp << endl;
    }
    return 0;
}