题目链接:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1001&cid=784
题意:
给你一个串s,求出满足S[i]=S[2n−i]=S[2n+i−2] (1≤i≤n)的超级回文子串有多少个
题解:
设p[i]为以第i个字符为中心的回文串半径-1
那仔细分析下题目,就会发现如果存在两个点(i, j)满足j-i<=min(p[i], p[j]),那么j和i就是一个超级回文子串的两个中心
所有这题就是求有多少对(i, j)满足j-i<=min(p[i], p[j])
考虑枚举i以p[i]为半径算贡献,显然贡献就是半径内所有满足j-i<=p[j]的j的个数,移项得p[j]-j>=-i
所以先令p[j] = p[j]-j,之后从大到小将p[]添加到数组中,用树状数组统计已经加入的p[]的个数即可
//2017CCPC哈尔滨--A
#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long
vector<int> G[500005];
int n, p[1000010], tre[500005];
char s[500010], str[1000010];
int Query(int x)
{
int ans = 0;
while(x)
{
ans += tre[x];
x -= x&-x;
}
return ans;
}
void Update(int x, int val)
{
while(x<=n)
{
tre[x] += val;
x += x&-x;
}
}
int main(void)
{
LL ans;
int T, i, j, k, mx, id;
scanf("%d", &T);
while(T--)
{
scanf("%s", s);
n = strlen(s);
str[0] = '$';
str[1] = '#';
for(i=0;i<=n-1;i++)
{
k = (i+1)*2;
str[k] = s[i];
str[k+1] = '#';
}
n = k+1;
str[n+1] = 0;
mx = 0;
for(i=1;i<=n;i++)
{
p[i] = 1;
if(mx>i)
p[i] = min(p[2*id-i], mx-i+1);
while(str[i+p[i]]==str[i-p[i]])
p[i]++;
if(p[i]+i-1>mx)
{
mx = p[i]+i-1;
id = i;
}
}
k = 1;
for(i=2;i<=n;i+=2)
{
p[k] = k+1-p[i]/2;
G[k+1-p[i]/2].push_back(k);
k += 1;
}
n = k-1;
ans = 0;
for(i=1;i<=n;i++)
{
for(j=0;j<G[i].size();j++)
Update(G[i][j], 1);
G[i].clear();
ans += Query(min(i+i-p[i], n))-Query(i);
}
G[i+1].clear();
memset(tre, 0, sizeof(tre));
printf("%lld\n", ans);
}
return 0;
}
/*
125
ababcbabccbaabc
abcbabc
abab
*/