# LWC 59：730. Count Different Palindromic Subsequences

## LWC 59：730. Count Different Palindromic Subsequences

Problem:

Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a string S is obtained by deleting 0 or more characters from S. A sequence is palindromic if it is equal to the sequence reversed. Two sequences A_1, A_2, … and B_1, B_2, … are different if there is some i for which A_i != B_i.

Example 1:

Input: S = ‘bccb’ Output: 6 Explanation: The 6 different non-empty palindromic subsequences are ‘b’, ‘c’, ‘bb’, ‘cc’, ‘bcb’, ‘bccb’. Note that ‘bcb’ is counted only once, even though it occurs twice.

Example 2:

Note:

The length of S will be in the range [1, 1000].

Each character S[i] will be in the set {‘a’, ‘b’, ‘c’, ‘d’}.

```初始化： ans = 0
1. 子问题的回文串批层外衣，有 ans += f(i + 1, j - 1) , 其中S[i] == S[j]
2. 考虑"a_..._a", "_..._"表示子问题的回文串，抽出a'= a...a，其中"..."表示x个a，那么有新的回文串aa...a 和 aa...aa,有ans += 2```

```    public int countPalindromicSubsequences(String S) {
int n = S.length();
int[][] next = new int[4][1010];
int[][] prev = new int[4][1010];

char[] cs = S.toCharArray();

for (int i = 0; i < 4; ++i) Arrays.fill(next[i], n);
for (int i = n - 1; i >= 0; --i) {
int c = cs[i] - 'a';
for (int j = 0; j < 4; ++j) next[j][i] = i + 1 == n ? n : next[j][i + 1];
next[c][i] = i;
}

for (int i = 0; i < 4; ++i) Arrays.fill(prev[i], -1);
for (int i = 0; i < n; ++i) {
int c = cs[i] - 'a';
for (int j = 0; j < 4; ++j) prev[j][i] = i - 1 == -1 ? -1 : prev[j][i - 1];
prev[c][i] = i;
}
dp = new int[1010][1010];
return f(cs, next, prev, 0, n - 1);
}

int mod = 1000000000 + 7;
int[][] dp;

int f(char[] cs, int[][] next, int[][] prev, int s, int e) {
if (s > e) return 0;
if (dp[s][e] > 0) return dp[s][e];
long ans = 0;
for (int i = 0; i < 4; ++i) {
int ns = next[i][s];
int ne = prev[i][e];
if (ns > ne) continue;
if (ns != ne) ans += 1;
ans ++;
ans += f(cs, next, prev, ns + 1, ne - 1);
}
dp[s][e] = (int)(ans % mod);
return dp[s][e];
}    ```

98 篇文章33 人订阅

0 条评论

## 相关文章

### 1082 线段树练习 3 区间查询与区间修改

1082 线段树练习 3 时间限制: 3 s 空间限制: 128000 KB 题目等级 : 大师 Master 题目描述 Description ...

2615

### hdu-----(1507)Uncle Tom's Inherited Land*(二分匹配)

Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others)    Memory Lim...

2284

2553

### 2017 Multi-University Training Contest - Team 9 1002&&HDU 6162 Ch’s gift【树链部分+线段树】

Ch’s gift Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K ...

2594

3427

### CodeForces 17E Palisection(回文树)

E. Palisection time limit per test 2 seconds memory limit per test 128 meg...

3214

661

### Gym 100952H&&2015 HIAST Collegiate Programming Contest H. Special Palindrome【dp预处理+矩阵快速幂/打表解法】

H. Special Palindrome time limit per test:1 second memory limit per test:64 mega...

2824

### HDU 1019 Least Common Multiple【gcd+lcm+水+多个数的lcm】

Least Common Multiple Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65...

2614

### HYSBZ 3676 回文串 (回文树)

3676: [Apio2014]回文串 Time Limit: 20 Sec  Memory Limit: 128 MB Submit: 1680  Solve...

3327