北邮oj--字符串转换

贪心算法的小应用

#include<stdio.h>
#include<bits/stdc++.h> 
#include<stdlib.h>
#include<cmath>
using namespace std;
int cToc(char c1,char c2){
	return min(abs(c2-c1),26-abs(c2-c1));
}
int turnToSimple(string s,char c){
	int result=0;
	for(int i=0;s[i]!='\0';i++){
		if(s[i]!=c){
			result+=cToc(s[i],c);
		}
	}
	return result;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		string s;
		s.resize(1000);
		scanf("%s",&s[0]);
		int min=turnToSimple(s,s[0]);
		set<char> sc;
		sc.insert(s[0]);
		for(int i=1;s[i]!='\0';i++){
			if(sc.find(s[i])!=sc.end()){
				continue;
			}
			int temp=turnToSimple(s,s[i]);
			if(min>temp){
				min=temp;
			}
			sc.insert(s[i]);
		}
		cout<<min<<endl;
	}
	return 0;
}