题目描述:给你n个数,m个区间,让你从这m个区间里面选择k个区间加上a之后,最大化它的最小值。
思路:二分答案,对于每个答案,检查是否符合时,可以将区间左端点进行排序,然后用优先队列,尽可能的往右覆盖所要加的最小值,检查最小值可以用差分树状数组实现。
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+150;
const int inf = 0x3f3f3f3f;
typedef long long ll;
int n,m,k,a;
int bit[maxn],num[maxn];
typedef pair<int,int> P;
P p[maxn];
int stk[maxn];
bool cmp(P x,P y){
return x.first < y.first;
}
int lowbit(int x){
return x & -x;
}
void add(int x,int c){
for(;x <= n; x += lowbit(x))bit[x] += c;
}
int que(int x){
int res = 0;
for(;x >= 1; x -= lowbit(x))res += bit[x];
return res;
}
bool check(int lim){
priority_queue<int> qu;
while(!qu.empty())qu.pop();
memset(bit,0,sizeof(bit));
int top = 0;
for(int i = 1;i <= n; i++){
if(num[i] < lim)stk[++top] = i;
}
int cnt = 0;
int j = 1;
for(int i = 1;i <= top; i++){
while(j <= m&&p[j].first <= stk[i])qu.push(p[j].second),j++;
while(num[stk[i]] + que(stk[i]) < lim){
cnt++;
if(cnt > k||qu.empty())return false;
int r = qu.top();qu.pop();
if(r < stk[i])return false;
add(stk[i],a);add(r+1,-a);
}
}
return true;
}
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d%d%d",&n,&m,&k,&a);
for(int i = 1;i <= n; i++){
scanf("%d",&num[i]);
}
for(int i = 1;i <= m; i++){
scanf("%d%d",&p[i].first,&p[i].second);
}
sort(p+1,p+1+m,cmp);
int l = 1,r = 1000000007;
while(l <= r){
int mid = (l+r)/2;
if(check(mid)) l = mid+1;
else r = mid-1;
}
printf("%d\n",l-1);
}
return 0;
}