AcWing 802. 区间和
题目
思路
vector<int> alls;
sort(alls.begin(), alls.end());
alls.erase(unique(alls.begin(), alls.end()), alls.end());
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;
}
代码
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,x,c,l,r;
typedef pair<int,int> P;
vector<int> alls;
vector<P> add,query;
const int N = 300005;
int a[N],s[N];
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;
}
int main()
{
cin>>n>>m;
for(int i = 1; i <= n; i++){
scanf("%d%d",&x,&c);
add.push_back({x,c});
alls.push_back(x);
}
for(int i = 1; i <= m; i++)
{
scanf("%d%d",&l,&r);
query.push_back({l,r});
alls.push_back(l);
alls.push_back(r);
}
sort(alls.begin(),alls.end());
alls.erase(unique(alls.begin(),alls.end()),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.first);
int r = find(item.second);
cout<<s[r] - s[l - 1]<<endl;
}
return 0;
}