Mirrored String II

Mirrored String II

Note: this is a harder version of Mirrored string I.
The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings.
A mirrored string is a palindrome string that will not change if you view it on a mirror.
Examples of mirrored strings are “MOM”, “IOI” or “HUH”. Therefore, mirrored strings must contain only mirrored letters {A, H, I, M, O, T, U, V, W, X, Y} and be a palindrome.
e.g. IWWI, MHHM are mirrored strings, while IWIW, TFC are not.
A palindrome is a string that is read the same forwards and backwards.
Given a string S of length N, help the gorillas by printing the length of the longest mirrored substring that can be made from string S.
A substring is a (possibly empty) string of characters that is contained in another string S. e.g. “Hell” is a substring of “Hello”.

input

The first line of input is T – the number of test cases.
Each test case contains a non-empty string S of maximum length 1000. The string contains only uppercase English letters.

output

For each test case, output on a line a single integer - the length of the longest mirrored substring that can be made from string S.

Example

Input
3
IOIKIOOI
ROQ
WOWMAN

Output
4
1
3

题目链接

题意
给你一个字符串，然后让你判断里面最长的回文子串的长度是多少。特殊要求：回文串必须是由题目上给的那个字母集合中的字母组成的才可以。
思路这个题没有什么太难的地方，直接从头到尾遍历就好了。先从前往后确定开头，然后再从后往前遍历，寻找回文串，在判断回文串的过程中，也要判断该子串中是否有题目所给字母集合之外的字母。然后保存回文串长度的最大值就好了。

#include <iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
using namespace std;
string s;
char ok[12] = {'A', 'H', 'I','M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'};
map<char,int> in;
bool is(int a,int b)//判断是否是回文串
{
    int p=b;
    for(int i=a;i<=(a+p)/2;i++)
    {
        if(in[s[i]]==0)
            return false;
        if(s[i]!=s[b])
            return false;
        b--;
    }
    return true;
}
int main()
{
    int T;
    for(int i=0;i<11;i++)
        in[ok[i]]++;//将题目所给字母放入map中，方便后面判断是否存在字母集合之外的字母
    scanf("%d",&T);
    while(T--)
    {
        cin>>s;
        int len=0;
        for(int i=0;i<s.size();i++)//从前往后遍历，确定回文子串的开头
        {
            if(in[s[i]]==0)
            continue;
            int p=s.size()-1;
            if(s.size()-i<=len)
                break;
            while(i<=p)//从后往前遍历，找到以s[i]为首的最长回文串
            {
                if(is(i,p))
                {
                    len=max(len,p-i+1);
                    break;
                }
                p--;
            }
        }
        cout<<len<<endl;
    }
}