【PAT甲级】1046 Shortest Distance (20)（前缀和）

题目链接

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, 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 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

思路：题目所给的一个环，Ｎ最大为10^5（数是连续的），求任意两点间的最短距离。

如果不管Ｎ的大小，容易想到是最短路问题，但是Ｎ太大了，这题所给的环是1,2,3,……,n这种连续的数构成。那么可以当做下标，求前缀和，再比较得到答案。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const int N = 1e5+5;

int sum[N];
int main()
{
    int n;
    cin>>n;
    int x;
    sum[0]=0;
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        sum[i]=sum[i-1]+x;
    }
    int a,b,m;
    scanf("%d",&m);
    while(m--)
    {
        cin>>a>>b;
        if(a>b) swap(a,b);
        int ans=sum[b-1]-sum[a-1];
        cout<<min(ans,sum[n]-ans)<<endl;
    }
    return 0;
}