hdu 5719Substring(后缀数组)

Substring

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1495    Accepted Submission(s): 587

Problem Description

?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its distinct substrings. 
But ?? thinks that is too easy, he wants to make this problem more interesting. 
?? likes a character X very much, so he wants to know the number of distinct substrings which contains at least one X. 
However, ?? is unable to solve it, please help him.

 

Input

The first line of the input gives the number of test cases T;T test cases follow. 
Each test case is consist of 2 lines: 
First line is a character X, and second line is a string S. 
X is a lowercase letter, and S contains lowercase letters(‘a’-‘z’) only.

T<=30 
1<=|S|<=10^5 
The sum of |S| in all the test cases is no more than 700,000.

 

Output

For each test case, output one line containing “Case #x: y”(without quotes), where x is the test case number(starting from 1) and y is the answer you get for that case.

 

Sample Input

  
  

   
   2 
a 
abc 
b 
bbb
  
  

 

Sample Output

  
  

   
   Case #1: 3 
Case #2: 3


   
   

    
    

     
     Hint
    
    
In first case, all distinct substrings containing at least one a: a, ab, abc. 
In second case, all distinct substrings containing at least one b: b, bb, bbb.
   
   
   
    
  
  

 

Author

FZU

 

Source

2016 Multi-University Training Contest 4

题意：求一个字符串当中包含x字符的不同子串个数

想法：后缀数组

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define N 100005
int wa[N],wb[N],wsf[N],wv[N],sa[N];
int Rank[N],height[N],s[N],f[N];
char str[N];//,str2[N];
//sa:字典序中排第i位的起始位置在str中第sa[i]
//rank:就是str第i个位置的后缀是在字典序排第几
//height：字典序排i和i-1的后缀的最长公共前缀
int cmp(int *r,int a,int b,int k)
{
    return r[a]==r[b]&&r[a+k]==r[b+k];
}
void getsa(int *r,int *sa,int n,int m)//n要包含末尾添加的0
{
    int i,j,p,*x=wa,*y=wb,*t;
    for(i=0; i<m; i++)  wsf[i]=0;
    for(i=0; i<n; i++)  wsf[x[i]=r[i]]++;
    for(i=1; i<m; i++)  wsf[i]+=wsf[i-1];
    for(i=n-1; i>=0; i--)  sa[--wsf[x[i]]]=i;
    p=1;
    j=1;
    for(; p<n; j*=2,m=p)
    {
        for(p=0,i=n-j; i<n; i++)  y[p++]=i;
        for(i=0; i<n; i++)  if(sa[i]>=j)  y[p++]=sa[i]-j;
        for(i=0; i<n; i++)  wv[i]=x[y[i]];
        for(i=0; i<m; i++)  wsf[i]=0;
        for(i=0; i<n; i++)  wsf[wv[i]]++;
        for(i=1; i<m; i++)  wsf[i]+=wsf[i-1];
        for(i=n-1; i>=0; i--)  sa[--wsf[wv[i]]]=y[i];
        t=x;
        x=y;
        y=t;
        x[sa[0]]=0;
        for(p=1,i=1; i<n; i++)
            x[sa[i]]=cmp(y,sa[i-1],sa[i],j)? p-1:p++;
    }
}
void getheight(int *r,int n)//n不保存最后的0
{
    int i,j,k=0;
    for(i=1; i<=n; i++)  Rank[sa[i]]=i;
    for(i=0; i<n; i++)
    {
        if(k)
            k--;
        else
            k=0;
        j=sa[Rank[i]-1];
        while(r[i+k]==r[j+k])
            k++;
        height[Rank[i]]=k;
    }
}
int main()
{
    int T;
    char C[2];
    scanf("%d",&T);
    getchar();
    for(int t = 1;t <= T;t++)
    {
        scanf("%s",C);
        scanf("%s",str);
        int n = strlen(str);
        for(int i = 0;i < n;i++)
            s[i] = str[i]-'a'+1;
        s[n] = 0;
        getsa(s,sa,n+1,31);
        getheight(s,n);
        int now = n;
        for(int i = n-1;i >= 0;i--)
        {
            if(str[i] == C[0]) now = i;
            f[i] = now;
        }
        long long tot = n - max(sa[1],f[sa[1]]);
        for(int i = 2;i <= n;i++)
         tot += n - max(sa[i]+height[i],f[sa[i]]);
        printf("Case #%d: %lld\n",t,tot);
    }
    return 0;
}