Codeforces 165C Another Problem on Strings 【二分】
来源:互联网 发布:登山鞋知乎 编辑:程序博客网 时间:2024/04/30 11:20
题目链接:Codeforces 165C Another Problem on Strings
C. Another Problem on Strings
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
A string is binary, if it consists only of characters “0” and “1”.
String v is a substring of string w if it has a non-zero length and can be read starting from some position in string w. For example, string “010” has six substrings: “0”, “1”, “0”, “01”, “10”, “010”. Two substrings are considered different if their positions of occurrence are different. So, if some string occurs multiple times, we should consider it the number of times it occurs.
You are given a binary string s. Your task is to find the number of its substrings, containing exactly k characters “1”.
Input
The first line contains the single integer k (0 ≤ k ≤ 106). The second line contains a non-empty binary string s. The length of s does not exceed 106 characters.
Output
Print the single number — the number of substrings of the given string, containing exactly k characters “1”.
Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
input
1
1010
output
6
input
2
01010
output
4
input
100
01010
output
0
Note
In the first sample the sought substrings are: “1”, “1”, “10”, “01”, “10”, “010”.
In the second sample the sought substrings are: “101”, “0101”, “1010”, “01010”.
题意:问你严格有k个1的子串数目。
思路:预处理前缀和,然后二分。
AC代码:
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <queue>#define CLR(a, b) memset(a, (b), sizeof(a))#define fi first#define se secondusing namespace std;typedef long long LL;typedef pair<int, int> pii;const int MAXN = 1e6 +10;const int INF = 0x3f3f3f3f;const int MOD = 1e9 + 7;void add(LL &x, LL y) { x += y; x %= MOD; }char str[MAXN];int sum[MAXN];int Find(int l, int r, int p, int v) { int ans = r + 1; while(r >= l) { int mid = (l + r) >> 1; if(sum[mid] - sum[p-1] >= v) { ans = mid; r = mid - 1; } else { l = mid + 1; } } return ans;}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++) { sum[i] = sum[i-1] + (str[i] == '1'); } LL ans = 0; for(int i = 1; i <= len; i++) { int s = Find(i, len, i, k); if(s == len + 1) continue; int t = Find(i, len, i, k+1); ans += t - s; } printf("%lld\n", ans); } return 0;}
- Codeforces 165C Another Problem on Strings 【二分】
- CodeForces 165C - Another Problem on Strings
- CodeForces 165C - Another Problem on Strings
- codeforces-165C-Another Problem on Strings
- codeforces 165C Another Problem on Strings 双指针
- CodeForces 165C Another Problem on Strings(公式推导)
- Another Problem on Strings CodeForces
- codeforce 165C Another Problem on Strings
- Codeforces Round #112 (Div. 2) C Another Problem on Strings
- Codeforces Round #112 (Div. 2) C. Another Problem on Strings
- Codeforces Round #112 (Div. 2) C Another Problem on Strings
- Codeforces 165C Another Problem On Strings 尺取 Or 前缀和
- codeforces 165-C. Another Problem on Strings(计数+尺取)
- codeforces 之 Another Problem on Strings
- Another Problem on Strings
- codeforces Another Problem on Strings 记录一个不慎
- cf165c Another Problem on Strings
- C. Another Problem on Strin
- 网页分享链接
- Eclipse构建maven web项目
- 任天堂将在2017年发布新主机Nintendo NX
- 自定义滑动菜单SlidingMenu
- 浅析android应用增量升级
- Codeforces 165C Another Problem on Strings 【二分】
- x264预设类参数详解
- Android 框架
- 高考后的重生
- Linux/Unix inode、vnode、dentry、file、进程表、文件表(上)
- 第43讲项目1—— 由键盘到文件
- android框架
- leetcode_204_Count Primes(C++)(easy)
- 无人驾驶!国产操作系统上的最高黑科技!