CodeForces - 165C Another Problem on Strings —— 前缀和字串
2018-01-23 19:58
405 查看
C. Another Problem on Strings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 %I64dspecifier.
Examples
input
output
input
output
input
output
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".
题意:给定一个只包含1和0的串,问其中恰好包含k个1的字串的个数
思路:开始还以为是道字符串的题肯定很麻烦连看都没看,训练完补题就后悔了...没想到字符串还能这么做
num[i]里面存的数表示从串首开始恰好有i个1的串的个数。
比如k=2,那么每次我们遇到一个有三个1的串,就相当于遇到了含一个1的串的个数个2个1的串。因为三个1的串剪掉从首开始一个1的串就是含两个1的串了。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 50using namespace std;
int num[1000010];
int main(int argc, char const *argv[]) {
ll k;
string s;
cin>>k>>s;
ll ans=0,cnt=0;
num[0]=1;
for(int i=0;i<s.size();i++)
{
if(s[i]=='1')
cnt++;
if(cnt>=k)
ans+=num[cnt-k];
num[cnt]++;
}
cout<<ans<<endl;
return 0;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 %I64dspecifier.
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".
题意:给定一个只包含1和0的串,问其中恰好包含k个1的字串的个数
思路:开始还以为是道字符串的题肯定很麻烦连看都没看,训练完补题就后悔了...没想到字符串还能这么做
num[i]里面存的数表示从串首开始恰好有i个1的串的个数。
比如k=2,那么每次我们遇到一个有三个1的串,就相当于遇到了含一个1的串的个数个2个1的串。因为三个1的串剪掉从首开始一个1的串就是含两个1的串了。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 50using namespace std;
int num[1000010];
int main(int argc, char const *argv[]) {
ll k;
string s;
cin>>k>>s;
ll ans=0,cnt=0;
num[0]=1;
for(int i=0;i<s.size();i++)
{
if(s[i]=='1')
cnt++;
if(cnt>=k)
ans+=num[cnt-k];
num[cnt]++;
}
cout<<ans<<endl;
return 0;
}
相关文章推荐
- Codeforces 460C Present 二分+前缀和
- Codeforces 873B Balanced Substring(利用前缀和找和为0的子串)
- codeforces 234C C. Weather(枚举+前缀后缀预处理)
- CodeForces 608B Hamming Distance Sum(前缀和)
- CodeForces - 831C: Jury Marks(前缀和去重、STL)
- Codeforces 106 D. Treasure Island(前缀和预处理)
- Codeforces 651D Image Preview【思维+二分+前缀后缀和】
- 后缀数组+最长公共前缀(LCS)+最长重复出现的不重叠字串(POJ 1743)
- 字符串相关处理kmp,前缀数,后缀树,后缀数组,最长回文串,最长重复字串,最长非重复字串
- CodeForces 873B Balanced Substring(前缀和+思维)
- codeForces 660C.Hard Process(二分+前缀和)
- codeforces 354 div2 C Vasya and String 前缀和
- Codeforces Round #427 (Div. 2) Problem C Star sky (Codeforces 835C) - 前缀和
- Codeforces 106 D. Treasure Island(前缀和预处理)
- codeforces 466-C. Number of Ways(前缀和+尺取)
- Codeforces 851D Arpa and a list of numbers【思维+前缀和】
- CodeForces 776C Molly's Chemicals (思维+前缀)
- codeforces 676C Vasya and String 前缀数组+二分查找
- Codeforces 835 C Star sky(前缀和)
- codeforces 835C(二维前缀和)