SPOJ AIBOHP - Aibohphobia--DP

https://www.spoj.com/problems/AIBOHP/

BuggyD suffers from AIBOHPHOBIA - the fear of Palindromes. A palindrome is a string that reads the same forward and backward.

To cure him of this fatal disease, doctors from all over the world discussed his fear and decided to expose him to large number of palindromes. To do this, they decided to play a game with BuggyD. The rules of the game are as follows:

BuggyD has to supply a string S. The doctors have to add or insert characters to the string to make it a palindrome. Characters can be inserted anywhere in the string.

The doctors took this game very lightly and just appended the reverse of S to the end of S, thus making it a palindrome. For example, if S = "fft", the doctors change the string to "ffttff".

Nowadays, BuggyD is cured of the disease (having been exposed to a large number of palindromes), but he still wants to continue the game by his rules. He now asks the doctors to insert the minimum number of characters needed to make S a palindrome. Help the doctors accomplish this task.

For instance, if S = "fft", the doctors should change the string to "tfft", adding only 1 character.

Input

The first line of the input contains an integer t, the number of test cases. t test cases follow.

Each test case consists of one line, the string S. The length of S will be no more than 6100 characters, and S will contain no whitespace characters.

Output

For each test case output one line containing a single integer denoting the minimum number of characters that must be inserted into S to make it a palindrome.

Example

Input:
1
fft

Output:
1

求回文子序列长度，再用字符串长度减去就好了。

#include<bits/stdc++.h>
# define ll long long
using namespace std;
const ll maxn=6605;
int dp[maxn][maxn];
char s1[maxn],s2[maxn];
int Get(char *a,char *b)
{
    int len=strlen(a);
    for(int i=1;i<=len;i++)
    {
        for(int j=1;j<=len;j++)
        {
            if(a[i-1]==b[j-1])
            {
                dp[i][j]=dp[i-1][j-1]+1;//
            }
            else
            {
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);//-----//
            }
        }
    }
    return dp[len][len];
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        scanf("%s",s1);
        int len=strlen(s1);
        for(int i=len-1,j=0;i>=0;i--,j++)
        {
            s2[j]=s1[i];
        }
        cout<<len-Get(s1,s2)<<endl;
    }
}