2022.2.2 训练日记6 AcWing 1952. 金发姑娘和 N 头牛

题目链接：金发姑娘和N头牛

---

题目分析：

0.差分 + 离散化。
1.题解参考

题解

---

code:

#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);
    }
    cout << res;
    return 0;
}

//手写离散化
#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;
int l[N], r[N], b[N * 2];
//查找当前值对于离散化之和的下标
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;
}

---

总结：

1.map实现离散化：
	优点：代码短
	缺点：常数大，容易被卡。
2.手写离散化：
	优点：高效。
	缺点：代码长。