子序列非重回文串

$考虑用总的回文串数减去非重复回文串数。实现用区间DP$
$1.f[i][j]表示[i,j]中回文串个数（可重复）$。
$f[i][j]=\{\begin{array}{ll}1& i=j\\ f[i][j-1]+f[i+1][j]+1& s[i]=s[j]\\ f[i][j-1]+f[i+1][j]-f[i+1][j-1]& s[i]\ne s[j]\end{array}$
$2.g[i][j]表示[i,j]中非重复回文串的个数。nex[i]表示s[nex[i]]=s[i]且(i,nex[i])中不存在j使得s[i]=s[j]。pre[i]同上。$
$g[i][j]=\{\begin{array}{ll}1& i=j\\ g[i][j-1]+g[i+1][j]-g[i+1][j-1]& s[i]\ne s[j]\\ 2\ast g[i+1][j-1]+2& s[i]=s[j],(i,j)中s[i]没有出现\\ 2\ast g[i+1][j-1]+1& s[i]=s[j],(i,j)中s[i]出现一次\\ 2\ast g[i+1][j-1]-g[nex[i]+1][pre[j]-1]& s[i]=s[j],(i,j)中s[i]出现两次及以上\end{array}$
$答案为f[1][n]-g[1][n]$