Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <vector>
- #include <map>
- #include <cstring>
- #include <queue>
- #include <algorithm>
- //#include <bits/stdc++.h>
- //#include <bits/stdc++.h>
- using namespace std;
- const int maxn = 5050;
- bool is_palindrome[maxn][maxn];
- int dp[maxn][maxn];
- string s;
- int rec(int i, int j) {
- if(i > j) {
- return 0;
- }
- if(dp[i][j] != -1) {
- return dp[i][j];
- }
- int result = 0;
- if(is_palindrome[i][j]) {
- result = 1;
- }
- result += rec(i + 1, j) + rec(i, j - 1) - rec(i + 1, j - 1);
- return dp[i][j] = result;
- }
- int main() {
- ios::sync_with_stdio(0);
- cin >> s;
- int n = s.size();
- memset(is_palindrome, false, sizeof is_palindrome);
- memset(dp, -1, sizeof dp);
- for(int sz = 1; sz <= n; sz++) {
- for(int at = 0; at <= n - sz; at++) {
- if(sz <= 2) {
- if(s[at] == s[at + sz - 1]) {
- is_palindrome[at][at + sz - 1] = true;
- }
- }
- else if(s[at] == s[at + sz - 1]) {
- is_palindrome[at][at + sz - 1] = is_palindrome[at + 1][at + sz - 2];
- }
- }
- }
- for(int i = 0; i < n; i++) {
- dp[i][i] = 1;
- }
- for(int i = 0; i + 1 < n; i++) {
- if(s[i] == s[i + 1]) {
- dp[i][i + 1] = 3;
- }
- else {
- dp[i][i + 1] = 2;
- }
- }
- rec(0, n - 1);
- int t;
- cin >> t;
- while(t--) {
- int L, R;
- cin >> L >> R;
- cout << dp[L - 1][R - 1] << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement