Codeforces Round #376 (Div. 2) A. Night at the Museum
来源:互联网 发布:淘宝全球买手申请 编辑:程序博客网 时间:2024/05/17 02:28
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he receivedembosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:
After Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.
Our hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.
The only line of input contains the name of some exhibit — the non-empty string consisting of no more than 100 characters. It's guaranteed that the string consists of only lowercase English letters.
Print one integer — the minimum number of rotations of the wheel, required to print the name given in the input.
zeus
18
map
35
ares
34
To print the string from the first sample it would be optimal to perform the following sequence of rotations:
- from 'a' to 'z' (1 rotation counterclockwise),
- from 'z' to 'e' (5 clockwise rotations),
- from 'e' to 'u' (10 rotations counterclockwise),
- from 'u' to 's' (2 counterclockwise rotations).
In total, 1 + 5 + 10 + 2 = 18 rotations are required.
思路:
要想知道从上一个字符到下一个字符需要转动的次数就要知道他是顺时针旋转还是逆时针旋转,如果是顺时针旋转旋转的次数就等于后一个数减去前一个数的绝对值,如果是逆时针旋转26-顺时针旋转。思路很简单但是一开始想偏了,首先他是个圆盘不是顺时针就是逆时针
代码:
#include<stdio.h>#include<cstring>#include<iostream>#include<algorithm>#include<math.h>#include<stdlib.h>#include<stack>#include<vector>#include<string.h>#include<map>#define INF 0x3f3f3f3f3fusing namespace std;int main(){ char a[1001]; while(~scanf("%s",a)) { int l=strlen(a); char ans='a'; int sum=0; for(int i=0;i<l;i++) { if(abs(a[i]-ans)>13) { sum+=(26-abs(a[i]-ans)); } else { sum+=abs(a[i]-ans); } ans=a[i]; } printf("%d\n",sum); }}
- Codeforces Round #376 (Div. 2) A. Night at the Museum
- Codeforces Round #376 (Div. 2) A. Night at the Museum
- 【Codeforces Round #376 (Div. 2)】 Codeforces 731A Night at the Museum
- Codeforces Round #376 (Div. 2) A. Night at the Museum(水题)
- Codeforces Round #376 (Div. 2) A. Night at the Museum【模拟】
- Codeforces Round #376 (Div. 2) A. Night at the Museum —— 循环轴
- CodeForces 731A Night at the Museum
- CodeForces 731A Night at the Museum
- CodeForces 731A-Night at the Museum
- codeforces 731A Night at the Museum
- CodeForces 731A Night at the Museum
- A. Night at the Museum
- 【87.65%】【codeforces 731A】Night at the Museum
- CodeForces 731A 之 Night at the Museum
- CodeForces 731A - Night at the Museum(模拟)
- CodeForces 731 A.Night at the Museum(水~)
- Codeforce 731A. Night at the Museum
- CodeForces 731A Night at the Museum(博物馆循环的单词表)
- Java异常分类
- C/S WPF(窗体)
- 单点登陆的技术
- oj求倒数和
- 第八周OJ-分数序列
- Codeforces Round #376 (Div. 2) A. Night at the Museum
- php文件复制、重命名、删除操作
- SElinux 常用命令
- JDBC工具类
- JavaScript基础之对象
- VS2010 可以使用 #pragma once 解决一次编译的问题
- Access restriction: The type 'BASE64Encoder'找不到Jar包
- Qt浅谈之二十二Qt样式表
- Spring aop集成环境配置出错解决方案