差分+离散化：金发姑娘和 N 头牛

原题链接：https://www.acwing.com/problem/content/1954/

/*
    妙啊
    
    定义正无穷和负无穷，定义Ai和Bi。
    -INF~Ai-1这个区间权值+=X， Ai~Bi这个区间权值+=Y，Bi到正无穷+=Z
    
    读入很多组数据
    
    现在需要枚举区间上的所有点，看看选哪个点可以取到最大值。
    
    但是只用到了3*N个点，虽然Ai Bi最大是1e9, 显然需要离散化
*/

#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>

using namespace std;

const int INF = 2e9;

int n, x, y, z;

int main()
{
    map<int, int> b;

    scanf("%d%d%d%d", &n, &x, &y, &z);
    for (int i = 0; i < n; i ++ )
    {
        int l, r;
        scanf("%d%d", &l, &r);
        b[-INF] += x;
        b[l] += y - x;
        b[r + 1] += z - y;
        b[INF] -= z;
    }

    int res = 0, sum = 0;
    for (auto& [k, v]: b)
    {
        sum += v;
        res = max(res, sum);
    }

    printf("%d\n", res);
    return 0;
}

手写离散化：

// 手写离散化
// 先用vector存，然后再int数组中算
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 20010, INF = 2e9;

int n, x, y, z;
vector<int> xs;
// l存A，r存B， b是差分数组
int l[N], r[N], b[N * 2];

// 二分找v在vector中的下标，因为vector已经排过序了
int find(int v)
{
    int l = 0, r = xs.size() - 1;
    while (l < r)
    {
        int mid = l + r >> 1;
        if (xs[mid] >= v) r = mid;
        else l = mid + 1;
    }
    return r;
}

int main()
{
    scanf("%d%d%d%d", &n, &x, &y, &z);

    xs.push_back(-INF), xs.push_back(INF);
    for (int i = 0; i < n; i ++ )
    {
        scanf("%d%d", &l[i], &r[i]);
        xs.push_back(l[i]);
        xs.push_back(r[i] + 1);
    }

    sort(xs.begin(), xs.end());
    // 点去重
    xs.erase(unique(xs.begin(), xs.end()), xs.end());

    for (int i = 0; i < n; i ++ )
    {
        int L = find(l[i]), R = find(r[i] + 1);
        b[0] += x;
        b[L] += y - x;
        b[R] += z - y;
        b[xs.size() - 1] -= z;
    }

    int res = 0, sum = 0;
    for (int i = 0; i < xs.size(); i ++ )
    {
        sum += b[i];
        res = max(res, sum);
    }

    printf("%d\n", res);
    return 0;
}