CROC-MBTU 2012, Elimination Round (ACM-ICPC) Queries for Number of Palindromes

题目链接：Problem - 245H - Codeforces

You've got a string s = s 1 s 2... 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 l s l + 1... s r (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s 1 s 2... 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 1 t 2... t |t| = t |t| t |t| - 1... t 1.

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 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.

Examples

input

Copy

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

output

Copy

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».

题意：给你一个字符串，然后n次查询，查询l-r的回文子串的数量

思路：我们可以用dp去求解l-r之间的回文串的数量

递推式子：num[l][r] = num[l + 1][r] + num[l][r - 1] - num[l + 1][r - 1]

然后判断l-r是否为回文，是则加1

#include<bits/stdc++.h>
using namespace std;

long long num[5005][5005]; //求l-r的回文数量
bool dp[5005][5005]; //判断L-R是否为回文

string s;
bool dfs(int l, int r){
	if(dp[l][r]){
		return true;
	}
	return dp[l][r] = (s[l] == s[r]) && (dfs(l + 1, r - 1));
}

int main(){
    int n;
    int a, b;
    while(cin >> s){
    	int len = s.length();
    	memset(dp, 0, sizeof(dp));
    	memset(num, 0, sizeof(num));
    	for(int i = 0; i < len; i++){
    		dp[i][i] = 1;
    		num[i][i] = 1;
		}
		for(int i = 0; i < len - 1; i++){
			if(s[i] == s[i + 1]){
				dp[i][i + 1] = 1;
				num[i][i + 1] = 3;
			}else{
				num[i][i + 1] = 2;
			}
		}
		for(int k = 2; k < len; k++){
			int i = 0;
			for(int j = k; j < len; j++){
				num[i][j] = num[i + 1][j] + num[i][j - 1] - num[i + 1][j - 1];
				if(dfs(i, j)){
					dp[i][j] = 1;
					num[i][j]++;
				}
				i++;
			}
		}
		scanf("%d", &n);
		for(int i = 0; i < n; i++){
			scanf("%d %d", &a, &b);
			a--;
			b--;
			printf("%lld\n", num[a][b]);
		}
	}	
	return 0;
}