NBUT [1665] 夜神的思考 【二分】

题目链接：NBUT [1665] 夜神的思考

题意：给定一个0-1串，问你子串中有k个1的数目。

二分一下就OK了。
$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef __int64 LL;
typedef pair<int, int> pii;
const int MAXN = 1e6 + 1;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void add(LL &x, LL y) { x += y; x %= MOD; }
int sum[MAXN];
char str[MAXN];
int main()
{
    int k;
    while(scanf("%d", &k) != EOF) {
        scanf("%s", str+1);
        int len = strlen(str+1); sum[0] = 0;
        for(int i = 1; i <= len; i++) {
            if(str[i] == '0') {
                sum[i] = sum[i-1];
            }
            else {
                sum[i] = sum[i-1] + 1;
            }
        }
        LL ans = 0;
        for(int i = 1; i <= len; i++) {
            int v = sum[i] - k;
            if(v < 0) continue;
            int p1 = lower_bound(sum, sum+i, v) - sum;
            int p2 = lower_bound(sum, sum+i, v+1) - sum;
            if(sum[i] - sum[p1] == k) {
                ans += p2 - p1;
            }
            //cout << ans << endl;
        }
        printf("%I64d\n", ans);
    }
    return 0;
}