离散化
Acwing802离散化
AC代码:
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> PII;
const int N=1e6+10;
int n,m;
int a[N],s[N];
vector<int>ails;
vector<PII>add,query;
int find(int x)
{
int l=0,r=ails.size()-1;
int mid=0;
while(l<=r)
{
mid=l+(r-l)/2;
if(ails[mid]<x)
l=mid+1;
else if(ails>x)
r=mid-1;
else
return mid+1;//使得前缀和返回的下标从1开始
}
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
int x,c;
cin>>x>>c;
add.push_back({x,c});
ails.push_back(x);
}
for(int i=1;i<=m;i++)
{
int l,r;
cin>>l>>r;
query.push_back({l,r});
ails.push_back(l);
ails.push_back(r);
}
sort(ails.begin(),ails.end());
ails.erase(unique(ails.begin(),ails.end()),ails.end());
for(auto item:add)
{
int x=find(item.first);
a[x]+=item.second;
}
for(int i=1;i<=ails.size();i++)
{
s[i]=s[i-1]+a[i];//前缀和
}
for(auto item:query)
{
int l=find(item.first),r=find(item.second);//查找区间
int tmp=s[r]-s[l-1];
cout<<tmp<<endl;
}
}