记做题时犯的错
题目地址:https://pintia.cn/problem-sets/994805342720868352/problems/994805435700199424
题目描述
The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.
输入格式
Each input file contains one test case. For each case, the first line contains an integer N (in [3,10^5]), followed by N integer distances D1,D2,⋯,Dn, where Di is the distance between the i-th and the (i+1)-st exits, and Dn is between the N-th and the 1st exits. All the numbers in a line are separated by a space. The second line gives a positive integer M (≤10^4), with M lines follow, each contains a pair of exit numbers, provided that the exits are numbered from 1 to N. It is guaranteed that the total round trip distance is no more than 10^7
.
输出格式
For each test case, print your results in M lines, e