离散化
例题
代码
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N=3e5+10;
typedef long long ll;
typedef pair<int,int> P;
vector<int> alls;
vector<P> add,query;
ll a[N],s[N];
ll find(ll x)
{
int r=0,l=alls.size()-1;
while(l>r)
{
int mid=(r+l)/2;
if(x>alls[mid]) r=mid+1;
else l=mid;
}
return l+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()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
ll x,c;
cin>>x>>c;
add.push_back({x,c});
alls.push_back(x);
}
for(int i=1;i<=m;i++)
{
ll r,l;
cin>>r>>l;
query.push_back({r,l});
alls.push_back(r);
alls.push_back(l);
}
sort(alls.begin(),alls.end());
alls.erase(unique(alls),alls.end());
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.second);
int r=find(item.first)-1;
cout<<s[find(item.second)]-s[find(item.first)-1]<<endl;
}
}