Problem 6116 --Shortest Distance (20)## 6116: Shortest Distance (20)

Time Limit: 1 Sec Memory Limit: 32 MB

Submit: 259 Solved: 56

[Submit][Status][Web Board][Creator:][下载FPS1元][添加到购物车][下载测试数据1元][500kb]## Description

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.

## Input

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 D_{1} D_{2} ... D_{N}, where D_{i} is the distance between the i-th and the (i+1)-st exits, and D_{N} 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}.

## Output

For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.

## Sample Input

5 1 2 4 14 9
3
1 3
2 5
4 1

## Sample Output

3
10
7

## HINT

## Source

[Submit][Status]