首页 > 代码库 > hdu----(5056)Boring count(贪心)
hdu----(5056)Boring count(贪心)
Boring count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 228 Accepted Submission(s): 90
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)
之前用一种动态规划式方法怎么用怎么TLE ，看了一下解题报告，发现有O(n)算法。觉得很是强大，........哎，还是太弱哇...╮(╯▽╰)╭
代码：
1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 4 using namespace std; 5 const int maxn=100050; 6 char str[maxn]; 7 int sac[27]; 8 int main() 9 {10 int cas,st,pos,k;11 scanf("%d",&cas);12 while(cas--)13 {14 memset(sac,0,sizeof(sac));15 scanf("%s %d",str,&k);16 __int64 ans=0;17 st=0;18 for(int i=0;str[i]!=‘\0‘;i++)19 {20 pos=str[i]-‘a‘;21 sac[pos]++;22 if(sac[pos]>k)23 {24 while(str[st]!=str[i])25 {26 sac[str[st]-‘a‘]--;27 st++;28 }29 sac[str[st]-‘a‘]--;30 st++;31 }32 ans+=(i-st+1);33 }34 printf("%I64d\n",ans);35 }36 return 0;37 }
hdu----(5056)Boring count(贪心)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。