整数离散化区间和

算法思路

即当数据值域很大，但实际上不需要存储这么多值，所以映射到一个数组即可，步骤如下：先统计添加到x和询问l和r的下标统一存入alls数组，经过一遍去重之后将其存入a数组，之后问题转化为前缀和。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef pair<int, int> PII;
const int N = 300010;
int a[N], s[N];
int n, m;

vector<int> alls;
vector<PII> add, query;

int find(int x)
{
    int l = 0, r = alls.size() - 1;
    while(l < r)
    {
        int mid = l + r >> 1;
        if(alls[mid] >= x) r = mid;
        else l = mid + 1;
    }
    return r + 1;
}
vector<int>:: iterator unique(vector<int> &a)
{
    int j = 0;
    for(int i = 0; i < a.size(); i ++)
        if(!i || a[i] != a[i - 1])
            a[j ++ ] = a[i];
    return a.begin() + j;
}

int main()
{
    cin >> n >> m;
    
    //读入n次操作，将x上加c
    for(int i = 0; i < n; i ++ )
    {
        int x, c;
        cin >> x >> c;
        add.push_back({x, c});

        alls.push_back(x);//顺序存储坐标
    }

    //读入m次询问，求区间[l,r]的和
    for(int i = 0; i < m; i ++ )
    {
        int l, r;
        cin >> l >> r;
        query.push_back({l, r});

        alls.push_back(l);
        alls.push_back(r);
    }

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

    //实际将数映射到a数组
    for(auto item : add)
    {
        int x = find(item.first);
        a[x] += item.second;
    }

    //前缀和
    for(int i = 1; i <= alls.size(); i ++ ) s[i] = s[i - 1] + a[i];

    //计算前缀和
    for(auto item : query)
    {
        int l = find(item.first), r = find(item.second);
        cout << s[r] - s[l - 1] << endl;
    }

    return 0;
}