输入数组长度及其内容，经过多次操作（将首尾数字移至尾部）后得到最小绝对值和

eg 输入N ，A【N】，输出min(|A[0]-1|+|A[1]-2|+……+|A[N-1]-N|）

import sys
import time

while True:


    line1 = sys.stdin.readline().strip()
    if line1 == '':
        break
    line2 = sys.stdin.readline().strip()

    starttime = time.clock()

    a = int(line1)
    b = [int(n) for n in line2.split()]



    j = 0
    min = 99
    while j <= 5:  # 重新排序一次
        c = b[1:]
        c.append(b[0])
        #print(c)

        i = 1
        temp = 0
        while i <= 5:  # 求和
            t = abs(c[i - 1] - i)
            temp = temp + t
            i = i + 1
            if i == 6:
                break
        #print(temp)
        if temp < min:
            min = temp
        # print(min)
        b = c
        j = j + 1

    print(min)
    endtime = time.clock()
    print("final is in",endtime-starttime)
    sys.exit()

 

输入输出总要搞好久，唉。