【P1496】火烧赤壁离散化 +差分

最新推荐文章于 2023-11-15 18:10:54 发布

不可知论大祭司

最新推荐文章于 2023-11-15 18:10:54 发布

阅读量159

点赞数

分类专栏： acm技巧

本文链接：https://blog.csdn.net/weixin_50070650/article/details/112990591

版权

acm技巧专栏收录该内容

12 篇文章 1 订阅

订阅专栏

code

#include <iostream>
#include <cctype>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;
inline int read(){
    int x = 0, op = 1; char ch = getchar();
    while (!isdigit(ch)){
        if (ch == '-') op = -1; ch = getchar();}
    while (isdigit(ch)){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * op;
}
const int N = 2e4 + 10;
int a[N], b[N], diff[N];
vector<int> v;

int getid(int x){
    return lower_bound(v.begin(), v.end(), x) - v.begin() + 1;
}

int main(){
    int n = read();
    for (int i = 1; i <= n; ++i) {
        v.push_back(a[i] = read());
        v.push_back(b[i] = read());
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    for (int i = 1; i <= n; ++i) {
        a[i] = getid(a[i]);
        b[i] = getid(b[i]);
        diff[a[i]]++;
        diff[b[i]]--;
    }
    int sum = 0, res = 0;
    for (int i = 1; i < v.size(); ++i) {
        sum += diff[i];
        if (sum > 0) res += v[i] - v[i - 1];
    }
    printf("%d\n", res);
    return 0;
}