#502. 01序列.,md

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	map<pii, int> st;
	int k;
	cin >> k;
	string s;
	cin >> s;
	int n = s.size();
	vector<int> cnt(n + 1, 0), suf(n + 1, 0);
	for (int i = 1; i <= n; i ++)
		cnt[i] = s[i - 1] - '0';
	for (int i = 1; i <= n; i ++) cnt[i] += cnt[i - 1];
	ll ans = 0, c = 0;
	for (int i = n; i >= 1; i --) {
		suf[i] = c;
		if (s[i - 1] =='1') c = 0;
		else c ++;
	}
// 	
	// for (int i = 1; i <= n; i ++)
		// cout << suf[i] << ' ';
	// puts("");
	for (int i = 1, j = 1; i <= n; i ++) {
		while (j <= n && cnt[j] - cnt[ i - 1] < k) {
			j ++;
		}
		if (j <= n && cnt[j] - cnt[i - 1] == k)
			{
				
				 ans += suf[j] + 1;
			}
		if (i + 1 > j) j ++;
	}
	cout << ans << endl;
	
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

给定一个01序列，找子串正好包括k个1的字串数目 预处理每个数字后面的0的个数。倒着处理