1046 Shortest Distance——PAT甲级(前缀和)

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

 solution:
 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main()
{
	int n;cin>>n;
	vector<ll>a(n+1);
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		int k;cin>>k;
		a[i]=a[i-1]+k;
		sum+=k;
	}
	int t;cin>>t;
	while(t--)
	{
		int j,k;cin>>j>>k;
		if(j>k)swap(j,k);
		cout<<min(a[k-1]-a[j-1],sum-a[k-1]+a[j-1])<<endl;
        //比较顺时针和逆时针走两者的最小值
	}
}