刚开始写的时候把连续的0块单独考虑了,实际上要放在一起考虑
思路:
找到连续0且等于b的个数num,只能放a个,故最差情况下num-a+1个就一定可以
代码:
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
#include <string>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
//#include <unordered_map>
#define guo312 std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define Inf LONG_LONG_MAX
#define inf INT_MAX
#define endl "\n"
#define PI 3.1415926535898
using namespace std;
const int N=2e5+10;
int ans[N];
char c[N];
int main(){
guo312;
int n,a,b,k; cin>>n>>a>>b>>k;
cin>>c+1;
int cnt=0,re=0;
for(int i=1;i<=n;i++){
if(c[i]=='1'){
cnt=0;
}
else{
cnt++;
if(cnt==b){
re++;
ans[re]=i;
cnt=0;
}
}
}
int si=re-a+1;
cout<<si<<endl;
for(int i=1;i<=si;i++){
cout<<ans[i]<<" ";
}
return 0;
}