Codeforces Gym100952 C. Palindrome Again !!-回文字符串 (2015 HIAST Collegiate Programming Contest)
1 second
64 megabytes
standard input
standard output
Given string with N characters, your task is to transform it to a palindrome string. It's not as easy as you may think because there is a cost for this transformation!!
First you have to start from character at given position P. From your position you always have 2 options:
- You can move one step to the right or to the left, the cost of each movement is 1. Assume that the string is cyclic, this means if you move one step to the left you will be at position P-1 if P > 1 or at the last character if P = 1, and if you move one step to the right you will be at position P+1 if P < N or at first character if P = N.
- You can change the letter at your current position by replacing it with the next or previous one in the English alphabet (assume that the alphabet is also cyclic so ‘a’ is after ‘z’). The cost of each replacement is also 1.
You should repeat that until the transformation is finished and the string is palindrome. What is the minimum cost to do that?
The first line contains the number of test cases T ( 1 ≤ T ≤ 100 ). Each test case contains 2 lines, the first line contains two integers ( 1 ≤ N ≤ 100,000) the length of string and ( 1 ≤ P ≤ N ) the initial position. While the second line contains a string with exactly N alphabetical characters.
For each test case output one line contains the minimum cost that is needed to change the string into a palindrome one.
1
8 3
aeabdaey
8
start with P = 3 ae(a)bdaey, move right => aea(b)daey, change to next => aea(c)daey, change to next => aea(d)deay, move left => ae(a)ddeay, move left => a(e)addeay, move left => (a)eaddeay, change to previous => (z)eaddeay, change to previous => (y)eaddeay. This costs 8 (4 movements and 4 replacements)
题意就是把一个串变成回文的,从指定的位置开始,然后就是可以向字母表左右变换,一个环,就是a->b,或者a->z都是变化1次。每次不变化走过的步数也算在内,问最少要多少次使得这个串变成回文的。
mdzz,写这个题的时候,因为是从0开始存的这个串,所以开始的位置也要-1,但是我是智障啊,忘了。。。
代码的意思就是只改变串的前一半,后一半就不变化了,然后再把走的步数加上就可以。
举个例子,aeabdaey,只看前4个,a和y不一样,要变化,是从a->b->c这样正着往下变呢,还是倒着a->z->y这样变呢,就需要找这两个的变化次数最小的,所以min比较一下。
然后第二个字母是e和倒数第二个字母e一样,不变化,再往下一步,第三个字母a和倒数第三个字母a一样,不变化,第四个字母b和倒数第四个字母d不一样,要变化。
接下来是走的步数怎么算呢。因为是拿前一半比较的,如果指定的位置在后一半,就把这个位置改成前一半,所以if(m>=n/2)m=n-m-1;
然后比较一下,这个变化之后的位置如果是在需要改变的第一个字母的前面,那么走的步数就是从最后一个需要改变的字母的位置-指定的位置就可以。
如果在之间,就是最后一个要改变的字母的位置-第一个要改变的字母的位置,再比较一下,指定的位置是先往左走还是先往右走使得走的步数最少,就需要min比较一下。
如果指定的位置在最后一个要改变的字母的右边,那就是指定的位置-第一个要改变的字母的位置。
其实就是一个区间的问题,很好想的,我这个智障都想明白了(托脸~)。
代码:
1 #include<bits/stdc++.h>
2 using namespace std;
3 const int INF=0x3f3f3f3f;
4 const int N=1e5+10;
5 char a[N];
6 int main(){
7 int t,n,m;
8 int minn,maxx,ans;
9 scanf("%d",&t);
10 while(t--){
11 scanf("%d%d",&n,&m);
12 scanf("%s",a);
13 m--; //指定的位置-1。
14 minn=INF;maxx=-1;ans=0;
15 for(int i=0;i<n/2;i++){ //只要前一半。
16 if(a[i]!=a[n-i-1]){
17 ans+=min(abs(a[i]-a[n-i-1]),26-abs(a[i]-a[n-i-1]));
18 minn=min(minn,i);maxx=max(maxx,i);
19 }
20 }
21 if(ans==0)printf("0\n");
22 else{
23 if(m>=n/2)m=n-m-1; //吧啦吧啦,看上面的解释。
24 if(m<=minn)ans+=maxx-m;
25 else if(m>minn&&m<maxx)ans+=maxx-minn+min((maxx-m),(m-minn));
26 else if(m>=maxx)ans+=m-minn;
27 printf("%d\n",ans);
28 }
29 }
30 return 0;
31 }
Codeforces Gym100952 C. Palindrome Again !!-回文字符串 (2015 HIAST Collegiate Programming Contest)的更多相关文章
- Gym 100952C&&2015 HIAST Collegiate Programming Contest C. Palindrome Again !!【字符串,模拟】
C. Palindrome Again !! time limit per test:1 second memory limit per test:64 megabytes input:standar ...
- Gym 100952H&&2015 HIAST Collegiate Programming Contest H. Special Palindrome【dp预处理+矩阵快速幂/打表解法】
H. Special Palindrome time limit per test:1 second memory limit per test:64 megabytes input:standard ...
- Codeforces Gym100952 A.Who is the winner? (2015 HIAST Collegiate Programming Contest)
A. Who is the winner? time limit per test 1 second memory limit per test 64 megabytes input stan ...
- Codeforces Gym100952 B. New Job (2015 HIAST Collegiate Programming Contest)
B. New Job time limit per test 1 second memory limit per test 64 megabytes input standard input ...
- Codeforces Gym100952 D. Time to go back-杨辉三角处理组合数 (2015 HIAST Collegiate Programming Contest)
D. Time to go back time limit per test 1 second memory limit per test 256 megabytes input standard ...
- Gym 100952A&&2015 HIAST Collegiate Programming Contest A. Who is the winner?【字符串,暴力】
A. Who is the winner? time limit per test:1 second memory limit per test:64 megabytes input:standard ...
- [LeetCode] Valid Palindrome 验证回文字符串
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignori ...
- 125 Valid Palindrome 验证回文字符串
给定一个字符串,确定它是否是回文,只考虑字母数字字符和忽略大小写.例如:"A man, a plan, a canal: Panama" 是回文字符串."race a c ...
- [LeetCode] 125. Valid Palindrome 验证回文字符串
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignori ...
随机推荐
- 【Random Forest】林轩田机器学习技法
总体来说,林对于random forest的讲解主要是算法概况上的:某种程度上说,更注重insights. 林分别列举了Bagging和Decision Tree的各自特点: Random Fores ...
- python-configparser模块,xml.etree模块
操作键值对文件 #文件db格式为 [section] a = 1 b = 2 [section1] d = 3 c = 4 import configparser #获取所有节点 config = c ...
- nodejs下载图片到本地,根据百度图片查找相应的图片,通过nodejs保存到本地文件夹
根据百度图片查找相应的图片:输入图片关键字,输入图片数量(默认是30条),通过nodejs将批量保存图片到本地文件夹. 代码已上传到github上:代码github的地址 下载后进去back-end: ...
- python学习总结---面向对象1
面向对象 - 与面向过程对比 - 面向过程:数学逻辑的映射,学会做个好员工. - 面向对象:生活逻辑的映射,学会做个好领导. - 生活实例 - 类: 人 手机 电脑 - 对象: 习大大.普京 二狗的i ...
- 孤荷凌寒自学python第五十三天使用python写入和修改Firebase数据库中记录
孤荷凌寒自学python第五十三天使用python写入和修改Firebase数据库中记录 (完整学习过程屏幕记录视频地址在文末) 今天继续研究Firebase数据库,利用google免费提供的这个数 ...
- (转) Unreal的HLSL交叉编译-UEAPI
HLSL Cross Compiler This library compiles High Level Shading Language (HLSL) shader source code into ...
- 1106 Lowest Price in Supply Chain (25 分)(树的遍历)
求叶子结点处能活得最低价格以及能提供最低价格的叶子结点的个数 #include<bits/stdc++.h> using namespace std; ; vector<int> ...
- python鉴黄程序
最近有客户向服务器上传了些垃圾图片,和正常图片混合在一起,大概有10W张的数量,在经历了大概3个小时翻了2000多张的时候,手指抽了下,感觉很不舒服,硬着头皮上,写个程序鉴别下吧,但是怎么搞呢,经过从 ...
- hdu1712 分组背包 ACboy needs your help
ACboy needs your help Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Ot ...
- UVALive 5029 字典树
E - Encoded Barcodes Crawling in process...Crawling failedTime Limit:3000MS Memory Limit:0KB 6 ...