SRM596 DIV2 250

一般编程题，如果用数组来处理，注意中间要忽略的城市

class FoxAndSightseeing:
    def getMin(self, position):
        minx = 999999999
        for i in range(1, len(position)-1):
            sumx = 0
            for k in range(1, len(position)):
                sumx += abs(position[k] - position[k-1])
            sumx -= abs(position[i] - position[i-1])
            sumx -= abs(position[i+1] - position[i])
            sumx += abs(position[i-1] - position[i+1])
            minx = min(sumx, minx)
        
        return minx

# test 
o = FoxAndSightseeing()
assert(o.getMin((1, 4, -1, 3)) == 4)
assert(o.getMin((-2, 4, 3)) == 5)
assert(o.getMin((100, -100, 99, -99)) == 199)

print('ok')

# test case