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 Specification:
Each input file contains one test case. For each case, the first line contains an integer N (in [3,105 ]), 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 (≤104), 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 107
.
Output Specification:
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
#include<iostream>
using namespace std;
const int maxn = 100010;
int main(){
/* 超时了
int n, sum = 0;
cin >> n;
int dist[maxn] = {0};
for(int i = 1; i <= n; i++){
cin >> dist[i];
sum += dist[i];
}
int m;
cin >> m;
int a, b;
for(int i = 0; i < m; i++){
int shortest = 0;
cin >> a >> b;
if(a > b) swap(a, b);
for(int i = a; i < b; i++){
shortest += dist[i];
}
if(shortest > sum - shortest){
shortest = sum - shortest;
}
cout << shortest << endl;
}
*/
int n, sum = 0;
cin >> n;
int dist[maxn] = {0}, d[maxn] = {0};
for(int i = 1; i <= n; i++){
cin >> d[i];
sum += d[i];
dist[i] = sum; //预处理dist数组
}
int m;
cin >> m;
int a, b;
for(int i = 0; i < m; i++){
int shortest = 0;
cin >> a >> b;
if(a > b) swap(a, b);
shortest = dist[b - 1] - dist[a - 1];
if(shortest > sum - shortest){
shortest = sum - shortest;
}
cout << shortest << endl;
}
return 0;
}