HDU 5056 Boring count(数学)
来源:互联网 发布:mac图片全屏 编辑:程序博客网 时间:2024/06/05 10:13
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5056
Problem Description
You are given a string S consisting of lowercase letters, and your task is counting the number of substring that the number of each lowercase letter in the substring is no more than K.
Input
In the first line there is an integer T , indicates the number of test cases.
For each case, the first line contains a string which only consist of lowercase letters. The second line contains an integer K.
[Technical Specification]
1<=T<= 100
1 <= the length of S <= 100000
1 <= K <= 100000
For each case, the first line contains a string which only consist of lowercase letters. The second line contains an integer K.
[Technical Specification]
1<=T<= 100
1 <= the length of S <= 100000
1 <= K <= 100000
Output
For each case, output a line contains the answer.
Sample Input
3abc1abcabc1abcabc2
Sample Output
61521
Source
BestCoder Round #11 (Div. 2)
官方题解:
代码如下:
#include <cstdio>#include <cstring>const int maxn = 100017;int main(){ int t; char str[maxn]; int st[27]; int k; scanf("%d",&t); while(t--) { memset(st,0,sizeof(st)); scanf("%s",str); scanf("%d",&k); __int64 ans = 0; int len = strlen(str); int startpos = 0; for(int i = 0; i < len; i++) { int tt = str[i] -'a'; st[tt]++; if(st[tt] > k) { while(str[startpos]!=str[i]) { st[str[startpos]-'a']--; startpos++; } st[str[startpos]-'a']--; startpos++; } ans+=i-startpos+1; } printf("%I64d\n",ans); } return 0;}
1 0
- HDU 5056 Boring count(数学)
- HDU 5056 - Boring count
- hdu 5056Boring count
- hdu 5056 Boring count
- hdu 5056 Boring count
- HDU 5056Boring count
- HDU 5056 Boring count(贪心)
- hdu 5056 Boring count (窗口滑动)
- hdu 5056 Boring count(尺取法)
- HDU 5056 Boring count(滑动窗口)
- HDU 5056 Boring Count --统计
- [周赛] HDU-5056 Boring count
- HDU 5056 Boring count(窗口滑动法)
- hdu 5056 Boring count ( 窗口转移法)
- hdu Boring count(BestCode round #11)
- HDU 5793 A Boring Question (数学)
- HUD 5056 Boring count
- hdoj-5056-Boring count
- LeetCode Permutations
- Ontology References
- [LeetCode] Path Sum
- 凯思面试经历转置一个string
- 交互原型 Axure RP的功能
- HDU 5056 Boring count(数学)
- 在VS2013 中使用VC 6.0 编写的MFC 程序
- mysql错误: Lock wait timeout exceeded; try restarting transaction
- source命令
- 中文乱码在java中URLEncoder.encode方法要调用两次解决
- 字符串数组越界bug(2)
- screen
- 抽象类
- Belief Propagation 相关资料及代码链接