【codeforces 798A】Mike and palindrome

【题目链接】:http://codeforces.com/contest/798/problem/A

【题意】

让你严格改变一个字符,使得改变后的字符串为一个回文串;
让你输出可不可能;

【题解】

直接无脑暴力改就好;
或者按照回文串的规则;
如果a[i]和a[n-i+1]不同则cnt++
然后看看最后cnt是不是恰好为1,或者为0然后字符串长度为奇数(那样中间那个字符可以任意改)

【Number Of WA】

0

【完整代码】

#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ms(x,y) memset(x,y,sizeof x)

typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};
const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};
const double pi = acos(-1.0);
const int N = 110;

string s;
int len;

bool ok(int l,int r)
{
    if (l>=r) return true;
    if (s[l]==s[r])
        return ok(l+1,r-1);
    else
        return false;
}

int main()
{
    //freopen("F:\\rush.txt","r",stdin);
    ios::sync_with_stdio(false),cin.tie(0);//scanf,puts,printf�ͱ�����!
    cin >> s;
    len = s.size();
    rep1(i,0,len-1)
    {
        char t = s[i];
        for (char key = 'a';key<='z';key++)
        if (key!=t)
        {
            s[i]=key;
            if (ok(0,len-1))
                return cout <<"YES"<<endl,0;
        }
        s[i] = t;
    }
    cout <<"NO"<<endl;
    return 0;
}

转载于:https://www.cnblogs.com/AWCXV/p/7626395.html