fork download
  1. for _ in range(input()):
  2. s = raw_input()
  3. l = len(s)
  4. costMap = {}
  5. costMap[s[0]] = 0
  6. for i in range(1,l):
  7. if not(s[i] in costMap):
  8. costMap[s[i]] = costMap[s[i-1]] + abs(ord(s[i])-ord(s[i-1]))
  9. else:
  10. costMap[s[i]] = min(costMap[s[i]], costMap[s[i-1]] + abs(ord(s[i])-ord(s[i-1])))
  11.  
  12. print costMap[s[-1]]
Success #stdin #stdout 0.01s 23352KB
stdin
1
abcdefac
stdout
2