CF 729D 模拟，思维

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define FF(i,a,b) for (int i=a;i<=b;i++)
#define F(i,b,a)  for (int i=b;i>=a;i--)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
typedef long long ll;
const int N = 2e5+10;

int main()
{
    vector<int >A;
    int n, a, b, k;
    string s;
    cin>>n>>a>>b>>k>>s;
    for(int i=0, c=1; i<n; i++, c++) {
        if(s[i]==‘1‘) c=0;
        else if(c==b) c=0, A.push_back(i+1);
    }
    cout<<A.size()-a+1<<endl;
    FF(i,0,A.size()-a) cout<<A[i]<<" ";

    return 0;
}