题意
给定一个1*n的矩形,里面有a个长度为b的船,已知有k个格子为空,问至少还要打几个格子才能一定打到船。
思路
贪心。首先根据已知的格子将矩形分成几个连续段,每一段左右端点为l,r,长度为k,那么每段最多
能容纳k/b个船,剩余段所能容纳的最多船为所有段相加为tmp。每次打格子,最坏情况下我们只能排除b个格子没船,
即打在一个段的右端点以左第b个格子(或左往右)。所以只要当前tmp>a,我们就排除b个格子,tmp--。
代码
#include <stdio.h>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
typedef struct node node;
struct node
{
int size,l,r;
bool operator < (const node &a) const{
return size < a.size;
}
};
vector <int>ans;
char str[201000];
int n,a,b,k;
int main(){
scanf("%d%d%d%d",&n,&a,&b,&k);
priority_queue <node > q;
scanf("%s",str);
str[n] = '1';
str[n + 1] = '\0';
int l = 0,r = 0,size = 0;
int tmp = 0;
ans.clear();
for(int i = 0;str[i];i ++){
if(size == 0){
if(str[i] == '0'){
l = i;
size = 1;
}
}
else{
if(str[i] == '0') size ++;
else{
if(size != 0){
r = i - 1;
if(size < b){
size = 0;
continue;
}
if(size/b > a){
for(int i = 1;i <= size/b - a;i ++){
ans.push_back(r - b + 1);
r -= b;
}
size = r - l + 1;
}
q.push((node){size,l,r});
tmp += size/b;
size = 0;
}
}
}
}
while(!q.empty() && tmp > a){
node now = q.top();
q.pop();
now.r -= b;
now.r ++;
ans.push_back(now.r);
now.r --;
now.size -= b;
tmp --;
if(now.size < b) continue;
q.push(now);
}
node now = q.top();
int mod = now.size%b;
ans.push_back(now.r - mod);
printf("%d\n",(int )ans.size() );
for(int i = 0;i <ans.size();i ++){
printf("%d%c",ans[i] + 1,i == ans.size() - 1?'\n':' ');
}
return 0;
}