题目:给定一个字符串,求字符串区间[l,r]中的不同子串的个数
1 <= length of s <= 2000
思路:先预处理出来,每当加入一个字符时,新增的子串为len[cur]-len[link[cur]]
代码:
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<numeric>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define INF 0x3f3f3f3f
#define mm(a,b) memset(a,b,sizeof(a))
#define PP puts("*********************");
template<class T> T f_abs(T a){ return a > 0 ? a : -a; }
template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; }
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
// 0x3f3f3f3f3f3f3f3f
//0x3f3f3f3f
const int MAXN = 4050, SIZE = 26;
struct SAM {
int len[MAXN], link[MAXN], next[MAXN][SIZE];
int total, last;
inline int newNode(int L) {
len[++total] = L; link[total] = 0;
for(int i = 0; i < SIZE; ++i) next[total][i] = 0;
return total;
}
inline int Add(int c) {
int i, p = last, cur = newNode(len[last] + 1);
for(; p && !next[p][c]; p = link[p]) next[p][c] = cur;
if(!p) link[cur] = 1;//令其指向初始状态
else {
int q = next[p][c];
if(len[q] == len[p] + 1) link[cur] = q;
else {//>
int clone = newNode(len[p] + 1);
for(i = 0; i < SIZE; ++i) next[clone][i] = next[q][i];
link[clone] = link[q];
link[q] = link[cur] = clone;
for(; p && next[p][c] == q; p = link[p]) next[p][c] = clone;
}
}
last = cur;
return len[cur]-len[link[cur]];
}
void Init () {//根节点是1
total = 0;
last = newNode(0);
}
}sam;
char str[MAXN];
int ans[2005][2005];
int main(){
int T,Q,l,r;
scanf("%d",&T);
while(T--){
scanf("%s",str);
int len=strlen(str);
for(int i=0;i<len;i++){
sam.Init();
int sum=0;
for(int j=i;j<len;j++){
sum+=sam.Add(str[j]-'a');
ans[i][j]=sum;
}
}
scanf("%d",&Q);
while(Q--){
scanf("%d%d",&l,&r);
printf("%d\n",ans[l-1][r-1]);
}
}
return 0;
}