codeforces 486C Palindrome Transformation(贪心)

题目链接

C. Palindrome Transformation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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?

Input

The first line contains two space-separated integers n (1 ≤ n ≤ 10⁵) 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.

Output

Print the minimum number of presses needed to change string into a palindrome.

Sample test(s)

Input

8 3
aeabcaez

Output

6

题意：长度为n的字符串（由小写字母组成），初始的时候光标在p处，每次操作可以将光标左移一位，右移一位（如果在第n个位置右移一位则移动到第一个位置，如果在第1个位置左移一位则移动到第n个位置）。每次操作还可以将光标处的字符变成它的上一字符或下一个字符（‘a’-‘z’也是循环的）。问把该字符串变为回文串的最小操作次数？

题解：要将该字符串变成回文串，只需要操作字符串的左一半或右一半即可，而具体哪一半取决于光标的初始位置。

代码如下：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
#include<set>
#define nn 110000
#define inff 0x3fffffff
#define eps 1e-8
#define mod 1000000007
typedef long long LL;
const LL inf64=LL(inff)*inff;
using namespace std;
int n,p;
string s;
int solve(char x,char y)
{
    int re=abs(x-y);
    re=min(re,x-'a'+1+('z'-y));
    re=min(re,'z'-x+1+y-'a');
    return re;
}
int main()
{
    int i;
    while(scanf("%d%d",&n,&p)!=EOF)
    {
        cin>>s;
        int ans=0;
        int l,r;
        l=-1;
        for(i=0;i<n/2;i++)
        {
            if(s[i]!=s[n-1-i])
            {
                if(l==-1)
                {
                    l=i;
                }
                r=i;
                ans+=solve(s[i],s[n-1-i]);
            }
        }
        if(l!=-1)
        {
            p--;
            if(p>=n/2)
                p=n-1-p;
            if(l>=p)
            {
                ans+=r-p;
            }
            else if(r<=p)
                ans+=p-l;
            else
                ans+=min(p-l,r-p)+r-l;
        }
        printf("%d\n",ans);
    }
    return 0;
}