DP问题--求取一个字符串回文串的多少

最新推荐文章于 2021-12-22 15:37:55 发布

nianiajr

最新推荐文章于 2021-12-22 15:37:55 发布

阅读量942

点赞数

文章标签： DP-空间DP 算法

本文链接：https://blog.csdn.net/liangjiaruifighting/article/details/8873511

版权

H - H

Time Limit:5000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 245H

Description

You've got a string s = s₁s₂... s_|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ |s|). The answer to the query is the number of substrings of string s[l_i... r_i], which are palindromes.

String s[l... r] = s_ls_l + 1... s_r (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s₁s₂... s_|s|.

String t is called a palindrome, if it reads the same from left to right and from right to left. Formally, if t = t₁t₂... t_|t| = t_|t|t_|t| - 1... t₁.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). The second line contains a single integer q (1 ≤ q ≤ 10⁶) — the number of queries. Next q lines contain the queries. The i-th of these lines contains two space-separated integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ |s|) — the description of the i-th query.

It is guaranteed that the given string consists only of lowercase English letters.

Output

Print q integers — the answers to the queries. Print the answers in the order, in which the queries are given in the input. Separate the printed numbers by whitespaces.

Sample Input

Input

caaaba
5
1 1
1 4
2 3
4 6
4 5

Output

Hint

Consider the fourth query in the first test case. String s[4... 6] = «aba». Its palindrome substrings are: «a», «b», «a», «aba».

这题采用的是区间DP问题，具体代码实现如下：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXN 5005
int flag[MAXN][MAXN],num[MAXN][MAXN]; 
int main(){
    char s[MAXN];
    int i,j,len,l,r,n;
    memset(flag,0,sizeof(flag));
    memset(num,0,sizeof(num));
    gets(s+1);
    len=strlen(s+1);
    for(i=1;i<=len;i++){
        flag[i][i]=1;//flag[i][i]表示i到i是不是一个回文串; 
        flag[i][i-1]=1;//这里是为了迎合后面的算法而做的准备， 明显i到i-1是倒着来了，表示的是一个空的回文串,但他也是一个回文串只要满足s[i]=s[i-1]; 
        num[i][i]=1;//每个单独字符都是一个回文串 
    }
    for(l=2;l<=len;l++)//为什么从l=2开始？因为长度为1的子串已经做了预处理，现在应该从长度为2的子串依次统计 i起的作用是规定长度 
        for(i=1,j=l;j<=len;j++,i++){//i++与j++完全迎合同一规定i长度下的回文串情况 
        flag[i][j]=flag[i+1][j-1]&&(s[i]==s[j]);
        num[i][j]=num[i][j-1]+num[i+1][j]-num[i+1][j-1]+flag[i][j];//这里便是进行区间的融合 
    }
    scanf("%d",&n);
    while(n--){
        scanf("%d%d",&r,&l);
        printf("%d\n",num[r][l]);
    }
    system("pause");
    return 0;
}

system("pause");
return 0;
}