离散化
a[] = { 1,3,8,10000 }
映射
b[] = { 0,1,2,3 };
1.a中可能有重复元素,需要去重, 用库函数,现sort再 a.erase(unique(a.begin(), a.end(), a.end()));
2.可以快速映射到b,利用二分查找。
例题:区间和
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int, int> PII;
const int N = 300010;
int n, m;
int a[N], s[N];
//a是映射后的数组,s是前缀和
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];
// a[0] ~ a[j - 1] 所有a中不重复的数
//return a.begin() + j;
//}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ )
{
int x, c;
cin >> x >> c;
add.push_back({x, c});
alls.push_back(x);
}
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);
}
//前面所有用到的坐标已经映射到alls中去了。包括操作数和区间端点。
// 去重
sort(alls.begin(), alls.end());
alls.erase((unique(alls), alls.end()),alls.end());
// 处理插入,把所有的造作数映射到a中,映射后坐标已经在alls中
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;
}
区间合并:
区间合并
求几个区间的∪;
1.按区间左端点排序;
2.三种关系:包含;左端不分包含;无交集
3.更新方法:
3.1包含:st和ed不会改变
3.2无交集:这个区间可以直接输出啦;更新st和ed
3.3左端部分包含:ed改变
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int, int> PII;
void merge(vector<PII> &segs)
{
vector<PII> res;
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for (auto seg : segs)
if (ed < seg.first)
{
if (st != -2e9) res.push_back({st, ed});
st = seg.first, ed = seg.second;
}
else ed = max(ed, seg.second);
if (st != -2e9) res.push_back({st, ed});
//这里注意对最后一组st和ed的操作,一定要防止该区间本就是空的情况
segs = res;
}
int main()
{
int n;
scanf("%d", &n);
vector<PII> segs;
for (int i = 0; i < n; i ++ )
{
int l, r;
scanf("%d%d", &l, &r);
segs.push_back({l, r});
}
merge(segs);
cout << segs.size() << endl;
return 0;
}