题目等价于在一个从下标1开始的长度为dist+1的滑动窗口中找k-1个最小值之和,在做这道题之前先做看这题480. 滑动窗口中位数,用两个对顶堆multiset,其中一个堆用于记录最小k(k+1)个值,另外一个堆用于记录最大k个值,而本题思路类似,其中一个堆用于记录最小k-1个值,另外一个堆用于记录最大dist+2-k个值,同时维护一个最小k-1个值之和
class Solution {
public:
multiset<int> big;
multiset<int> small; //sum
long long cur = 0;
void add(int i, int k){
if(small.size() < k-1){
cur += i;
small.insert(i);
}else{
auto it = prev(small.end());
if(*it > i){
small.insert(i);
cur += i - *it;
big.insert(*it);
small.erase(it);
}else{
big.insert(i);
}
}
}
void det(int i){
auto sit = small.find(i);
if(sit!=small.end()){
auto it = big.begin();
small.erase(sit);
cur += *it - i;
small.insert(*it);
big.erase(it);
}else{
big.erase(big.find(i)); //不能使用big.erase(i),会删除多个元素
}
}
long long minimumCost(vector<int>& nums, int k, int dist) {
long long ans = 0x3f3f3f3f3f3f3f3f;
for(int i=1;i<=dist+1;i++){
add(nums[i], k);
}
ans = min(ans, cur);
for(int i=dist+2; i<nums.size(); i++){
add(nums[i], k);
det(nums[i-dist-1]);
ans=min(ans, cur);
}
return ans+nums[0];
}
};
类似的题目E - Best Performances
代码如下
#include <iostream>
#include <queue>
#include <vector>
#include <set>
#include<algorithm>
using namespace std;
multiset<int> small, big;
int k;
long long s = 0;
void add(int i){
if(int(big.size()) < k){
big.insert(i);
s+=i;
}else{
auto it = big.begin();
if(*it < i){
s += i-*it;
big.insert(i);
small.insert(*it);
big.erase(it);
}else{
small.insert(i);
}
}
}
void det(int i){
auto it = big.find(i);
if(it!=big.end()){
s+= *prev(small.end()) - i;
big.erase(it);
big.insert(*prev(small.end()));
small.erase(prev(small.end()));
}else{
small.erase(small.find(i));
}
}
const int N=5e5+5;
int arr[N];
int main()
{
int n,q;
cin>>n>>k>>q;
for(int i=1;i<=n;i++){
arr[i] = 0;
add(0);
}
for(int i=0;i<q;i++){
int x,y;
cin>>x>>y;
add(y); //这里必须先添加后删除,否则当n==k时使用det会出现runtime error的错误
det(arr[x]);
arr[x] = y;
cout<<s<<endl;
}
}