Palindrome Transformation
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a palindrome by using 4 arrow keys: left, right, up, down.
There is a cursor pointing at some symbol of the string. Suppose that cursor is at position i (1 ≤ i ≤ n, the string uses 1-based indexing) now. Left and right arrow keys are used to move cursor around the string. The string is cyclic, that means that when Nam presses left arrow key, the cursor will move to position i - 1 if i > 1 or to the end of the string (i. e. position n) otherwise. The same holds when he presses the right arrow key (if i = n, the cursor appears at the beginning of the string).
When Nam presses up arrow key, the letter which the text cursor is pointing to will change to the next letter in English alphabet (assuming that alphabet is also cyclic, i. e. after 'z' follows 'a'). The same holds when he presses the down arrow key.
Initially, the text cursor is at position p.
Because Nam has a lot homework to do, he wants to complete this as fast as possible. Can you help him by calculating the minimum number of arrow keys presses to make the string to be a palindrome?
The first line contains two space-separated integers n (1 ≤ n ≤ 105) and p (1 ≤ p ≤ n), the length of Nam's string and the initial position of the text cursor.
The next line contains n lowercase characters of Nam's string.
Print the minimum number of presses needed to change string into a palindrome.
8 3 aeabcaez
6
A string is a palindrome if it reads the same forward or reversed.
In the sample test, initial Nam's string is: (cursor position is shown bold).
In optimal solution, Nam may do 6 following steps:
![](https://i-blog.csdnimg.cn/blog_migrate/7720511aef3325a7ebe0f818166c2a87.png)
The result, , is now a palindrome.
给出字符串的长度和光标的初始位置,问最少经过多少变换可以将字符串变成回文串,左右移动算一次变换,字母转换也算变换a到z需要变换25次
一开始想的复杂了,进行了左移右移两次计算,然后比较最小值,只要做一下简单标记就可以了
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define mt(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e5+10;
char str[maxn];
int main(){
int t, n, k, s, e, ans, flag;
scanf("%d%d", &n, &k);
scanf(" %s", str+1);
ans = s = e = 0;
for(int i = 1; i <= n/2; i++){//化简为计算左半部分
int a, b, c;
a = str[i];
b = str[n-i+1];
c = 0;
if(a > b) c = min(a-b, b+26-a);
else c = min(b-a, a+26-b);
if(c && !s) s = i;//标记需要变换的左右端点
if(c) e = i;
ans += c;
}
if(!s && !e){
ans = 0;
}
else{
if(k > n/2) k = n-k+1;
if(k < s) s = k;
if(k > e) e = k;
int l, r;
l = k-s;
r = e-k;
ans += min(l*2 + r, r*2 + l);
}
printf("%d\n", ans);
return 0;
}