Night at the Museum

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sinat_39618052/article/details/79979902
A. Night at the Museum
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser 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.

Input

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.

Output

Print one integer — the minimum number of rotations of the wheel, required to print the name given in the input.

Examples
Input
Copy
zeus
Output
Copy
18
Input
Copy
map
Output
Copy
35
Input
Copy
ares
Output
Copy
34
Note

 

To print the string from the first sample it would be optimal to perform the following sequence of rotations:

  1. from 'a' to 'z' (1 rotation counterclockwise),
  2. from 'z' to 'e' (5 clockwise rotations),
  3. from 'e' to 'u' (10 rotations counterclockwise),
  4. from 'u' to 's' (2 counterclockwise rotations).
In total, 1 + 5 + 10 + 2 = 18 rotations are required.

http://codeforces.com/problemset/problem/731/A
#include<iostream>
using namespace std;
char a[]="abcdefghijklmnopqrstuvwxyz";   
int main ()
{
    string s;
	while(cin>>s)
	{
		int now=0,next,ans=0;
		for(int i=0;i<s.size();i++)
		{
			next=s[i]-'a';
		    ans+=min(abs(next-now),min((now+26-next),(26-now+next)));
		    now=next;	
		} 
	cout<<ans<<endl;	
	} 	
} 

题解:

很基础的题

有三种情况需要判别:

1、直接相减首尾距离abs(next-now),例如:a->c

2、从后向前now+26-next   例如 z->c

3、从头到尾都要  例如  b->x

Imperishable Night

08-27

It's the eve of the Harvest Moon Festival in Gensokyo when Flandre Scarlet senses that something is wrong with the moon. It appears that the moon has been replaced by a fake moon. Someone must freeze time and find the real moon to ensure a full moon on the night of the festival. Remilia Scarlet tells her that she must go into the Bamboo Forest of the Lost (迷いの竹林) to investigate and gain enough points to remedy this.nn二小姐nFlandre sets off immediately. When she arrives at the entry of the Bamboo Forest of the Lost, she finds that there are n different parts. According to Remilia, there are two kinds of mysterious halidom, ITEM and TIME, that will increase Flandre's points:nnWhen Flandre is at the entry, she can choose any path she hasn't choosed before and collects all ITEM and TIME there, then goes back to the entry.nThere are two values, IV (ITEM Value) and TV (TIME Value) relating to how many points Flandre can gain when she collect a piece of ITEM or a piece of TIME.nThe initial IV, TV and point of Flandre are all 0.nWhen she chooses a new part, her IV and TV and point keep the same as the end of he previous collection.nIn parti, there are xi pieces of ITEM with value ai and yi pieces of TIME with value bi.nWhen she collects a piece of ITEM, her point will increase IV (point += IV), and her TV will increase ai (TV += ai) immediately as well.nwhen she collects a piece of TIME, her point will increase TV (point += TV), and her IV will increase bi (IV += bi) immediately as well.nObviously, Flandre's IV and TV will be changing when she is collecting ITEM and TIME, thus the order of collection is important. Morever, the order of the parts she chooses is crucial too. Flandre should gain as many points as possible. Your task is to calculate the maximal point Flandre can gain.nnInputnnThe input contains multiple test cases (no more than 100). The first line of each case is an integer n (1 ≤ n ≤ 15), indicating the number of parts of the forest. Then follows n lines, the i-th (1 ≤ i ≤ n) of them contains 4 integers ai, bi, xi, yi (0 ≤ ai, bi ≤ 20, 0 ≤ xi, yi ≤ 30), as described above.nnOutputnnFor each case, output the maximal point Flandre can gain in a single line.nnSample Inputnn1n1 2 1 1n3n2 2 2 2n2 2 2 2n2 2 2 2nSample Outputnn2n72

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭