Problem Description : With a string of X, we call the new string is inserted after any number of spaces in the middle of the head and tail and composed for the X X extension string , such as string X is "abcbcd", the string "abcb □ cd", "□ a □ bcbcd □" and "abcb □ cd □" are X extensions string here "□" on behalf of a space character. If A1 is the extended string string A , B1 B is an extension of substrings , A1 and B1 have the same length , then we define a string from the sum of the distances A1 and B1 on the corresponding character position , and the two from the definition of non- space character is absolute difference of their ASCII codes, and the distance to any other character with a space character between a known K, from the space character and the space character value is O. String A, B in all the extended string , and so there must be two extended string length A1, B1, so that the distance between A1 and B1 to a minimum , this distance will be defined as a string A, the

字符串的距离(2).cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．