PAT甲级1040

solution

#include <iostream>
#include <cstring>
using namespace std;
string a;
int check(int i)
{
    int count1 = 1;
    int x = i - 1, y = i + 1;
    while (a[x] == a[y] && x >= 0 && y < a.size())
    {
        x--;
        y++;
        count1 += 2;
    }
    return count1;
}
int check2(int i)
{
    int count1 = 0;
    int x = i, y = i + 1;
    while (a[x] == a[y] && x >= 0 && y < a.size())
    {
        x--;
        y++;
        count1 += 2;
    }
    return count1;
}
int main()
{
    getline(cin, a);
    int maxx = 0;
    if (a.size() == 1)
    {
        cout << 1;
        return 0;
    }
    for (int i = 1; i < a.size() - 1; i++)
    {
        maxx = max(maxx, check(i));
    }
    for (int i = 0; i < a.size() - 1; i++)
    {
        maxx = max(maxx, check2(i));
    }
    cout << maxx;
}