Palindrome Transformation
题意:给定一个字符串和光标的初始位置,每一步可以左右移动一位或将字符上下加1,求最小步数使之成为回文串
分析:
1.要使成为回文串,即对应字符相等,无论变左边的 还是变右边的 亦或是左边变一点右边变一点,总步数都是一样的,所以差别就在于移动上
2.显然,全部动左边的或者全部动右边的,可以最优
3.为方便,统一动左边的,如果初始位置在右边,我们可以将它移到左边的对应位置(不计步数)
4.接下来算每一个对应的位置的最小步数
5.加上移动的最小步数就是最后的结果
Code:
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a));
#define lowbit(x) (x & -x)
#define lrt nl, mid, rt << 1
#define rrt mid + 1, nr, rt << 1 | 1
template <typename T>
inline void read(T& t) {
t = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
t = t * 10 + ch - '0';
ch = getchar();
}
t *= f;
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll Inf = 9223372036854775807;
const int inf = 0x3f3f3f3f;
const double eps = 1e-5;
const int maxn = 1e5 + 5;
char ss[maxn];
int main(void) {
int n, m;
read(n), read(m);
cin >> ss + 1;
if (m > n / 2)
m = n - m + 1;
int sum = 0;
for (int i = 1; i <= n / 2; i++) {
int res = min(abs(ss[i] - ss[n - i + 1]),
min(abs(ss[i] + 26 - ss[n - i + 1]),
abs(ss[i] - 26 - ss[n - i + 1])));
sum += res;
}
int l = n, r = 1;
for (int i = 1; i <= n / 2; i++) {
if (ss[i] != ss[n - i + 1]) {
l = min(l, i);
r = max(r, i);
}
}
if (sum == 0)
printf("0\n");
else
printf("%d\n", sum + (r - l) + min(abs(m - l), abs(m - r)));
return 0;
}