Codeforces 245H Queries for Number of Palindromes （区间DP）

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

String s[l... r] = slsl + 1... sr (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s1s2... 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 = t1t2... t|t| = t|t| t|t| - 1... t1.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). The second line contains a single integer q (1 ≤ q ≤ 106) — the number of queries. Next q lines contain the queries. The i-th of these lines contains two space-separated integers li, ri (1 ≤ li ≤ ri ≤ |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.

Examples

Input

caaaba

5
1 1
1 4
2 3
4 6
4 5

Output

1
7
3
4
2

Note

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

 

题意：给你一个字符串，q次查询，问你这个区间的回文串个数多少？

解题思路：

求解区间问题，如果不超过存储范围就可以用区间dp。先预处理每个区间是否是回文串。然后区间dp寻找回文串个数

如果长度为2的区间（l==1) 那么很明显 最多只有三种回文个数

否则的话 那么我们就需要根据容斥原理计算一下i+1到 j-1范围内回文个数  加上当前这整个区间是否是回文串

最后查询 0（1）输出

#include<stdio.h>
#include<String.h>
#include<algorithm>
using namespace std;
const int maxn=5e3+10;
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
char ch[maxn];
int n,m,dp[maxn][maxn];
bool Is[maxn][maxn];
int main(){
	int i,j,l;
	scanf("%s",ch);
	int len=strlen(ch);
	mem(Is,0);mem(dp,0);
	for(i=0;i<len;i++) Is[i][i]=true;
	for(l=1;l<len;l++){
		for(i=0;i<len-l;i++){
			j=i+l;
			if(ch[i]==ch[j]){
				if(l==1) Is[i][j]=true;
				else{
					if(Is[i+1][j-1]) Is[i][j]=true;
				}
			}
		}
	}
	for(i=0;i<len;i++) dp[i][i]=1;
	for(l=1;l<len;l++){
		for(i=0;i<len-l;i++){
			j=i+l;
			if(l==1) dp[i][j]=dp[i][i]+dp[j][j]+Is[i][j];
			else dp[i][j]=dp[i+1][j]+dp[i][j-1]-dp[i+1][j-1]+Is[i][j];
		}
	}
	scanf("%d",&m);
	while(m--){
		int l,r;
		scanf("%d%d",&l,&r);
		printf("%d\n",dp[l-1][r-1]);
	}
	return 0;
}