HDU 5056 双指针（也叫窗口滑动（也叫尺取法))

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

 

Output

For each case, output a line contains the answer.

 

Sample Input

3abc1abcabc1abcabc2 

 

Sample Output

61521 

 
此题允许不同位置上的相同字母算作不同种类


双指针（也叫窗口滑动（也叫尺取法)):
定义两个指针，始终保持指针内的子串符合题目要求，向右移动右指针，若不符合要求，则将左指针向右移动直到指针内的子串符合题目要求为止。这样就求出了每个点向左延伸最远符合要求的点，于是这个区间内的任意一个子串都是符合题目要求的，不断累加即可。
复杂度：O（n）.

---

#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<map>#define INF 0x3f3f3f3fusing namespace std;char s[1000000];int vis[100];int main(){    int T,a;    while(~scanf("%d",&T))    {        while(T--)        {            long long sum=0;            scanf("%s%d",s,&a);            memset(vis,0,sizeof(vis));            int len=strlen(s);            int pos=0;                        //左指向            for(int i=0; i<len; i++)         //右指向            {                int x=s[i]-'a';                vis[x]++;                if(vis[x]>a)                {                    while(s[i]!=s[pos])                    {                        vis[s[pos]-'a']--;                        pos++;                    }                    vis[s[pos]-'a']--;                    pos++;                }                sum+=i-pos+1;            }            printf("%I64d\n",sum);        }    }}/* 例如 abcabc 1                 a       ab          abc        bca        ..... sum+     1      2        3           3           3                 a        b           c           a      ab         bc          caabc         bca 故15种*/