分数:这题有pam的扩展,2500
地址:https://nanti.jisuanke.com/t/A1955
A number is skr, if and only if it’s unchanged after being reversed. For example, “12321”, “11” and “1” are skr numbers, but “123”, “221” are not. FYW has a string of numbers, each substring can present a number, he wants to know the sum of distinct skr number in the string. FYW are not good at math, so he asks you for help.
Input
The only line contains the string of numbers
S
S
S.
It is guaranteed that
1
≤
S
[
i
]
≤
9
1≤S[i]≤9
1≤S[i]≤9, the length of
S
S
S is less than
2000000
2000000
2000000.
Output
Print the answer modulo 1000000007 1000000007 1000000007
样例输入1
111111
样例输出1
123456
样例输入2
1121
样例输出2
135
题意:
给定一个数字串,计算在这个数字串中所有出现的不同的回文数的总和,答案对
1
0
9
+
7
10^9+7
109+7取模
题解:
回文自动机
首先第一个问题是找出本质不同的回文串
每个节点开一个值表示当前这个节点所代表的回文串所代表的数字是多少。
最后遍历每个节点把每个节点的这个数字加起来就行。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD=1000000007;
const int D=11;
const int MAXN=2000004;
int n;
char s[MAXN];
ll bin[MAXN];
struct PAM{
int last,cnt;
int ch[MAXN][D],fa[MAXN],sz[MAXN],len[MAXN];
ll ans[MAXN];
int create(int Len,int Fa){
len[cnt]=Len;
fa[cnt]=Fa;
return cnt++;
}
void CLEAR(){
for(int i=0;i<cnt;i++){
len[i]=0;sz[i]=0;fa[i]=0;
ans[i]=0;
memset(ch[i],0,sizeof(ch[i]));
}
last=0;
cnt=0;
create(0,1);
create(-1,0);
}
int getfail(int p,int n){
for(;s[n-len[p]-1]!=s[n];p=fa[p]);
return p;
}
int add(int c,int pos){
int p=getfail(last,pos);
if(!ch[p][c]){
int nt=create(len[p]+2,ch[getfail(fa[p],pos)][c]);
if(len[nt]==1){
ans[nt]=c;
}
else if(len[nt]==2){
ans[nt]=c*10+c;
}
else{
ans[nt]=(ans[p]*10+c)%MOD;
ans[nt]+=(c*bin[len[nt]-1])%MOD;
ans[nt]%=MOD;
}
ch[p][c]=nt;
}
last=ch[p][c];
sz[last]++;
return last;
}
ll getans(){
ll res=0;
for(int i=cnt-1;i>=2;i--){
res+=ans[i];
res%=MOD;
}
return res;
}
}pam;
int w33ha(){
n=strlen(s+1);
pam.CLEAR();
for(int i=1;i<=n;i++){
pam.add(s[i]-'0',i);
}
printf("%lld\n",pam.getans());
return 0;
}
int main(){
bin[0]=1;
for(int i=1;i<=MAXN;i++)bin[i]=(bin[i-1]*10)%MOD;
while(scanf("%s",s+1)!=EOF)w33ha();
return 0;
}