Shortest Distance

def solve(n, dists_data, q, queries_data):
    n = int(n)
    dists = list(map(int, str(dists_data).split(',')))
    q = int(q)
    queries = str(queries_data).strip().split(',')
    total = sum(dists)
    prefix = [0] * (n + 1)
    for i in range(n):
        prefix[i+1] = prefix[i] + dists[i]
    for qstr in queries[:q]:
        a, b = map(int, qstr.split())
        a -= 1
        b -= 1
        if a > b:
            a, b = b, a
        cw = prefix[b] - prefix[a]
        print(min(cw, total - cw))