PAT A1046: Shortest Distance

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
时间限制: 100ms
内存限制: 64MB
代码长度限制: 16KB

分析：为了防止运行超时，用数组total[i]存储1到i的距离，点a到b的第一个距离为len1=total[a]-total[b]，点a到点b的第二个距离为len2=total[a]+total[n]-total[b]+num；num储存从n到0的直接距离

#include"stdafx.h"
const int maxn = 100005;
const int maxm = 10005;
int main()
{
    int n, num, m, ans[maxm], total[maxn] = { 0 };
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &num);
        if (i < n) {
            total[i + 1] = total[i] + num;
        }
    }
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        int a, b,c ,len1,len2;
        scanf("%d %d", &a, &b);
        if (a > b) {    //保证使a<b；
            c = a;
            a = b;
            b = c;
        }
        len1 = total[b] - total[a];
        len2 = total[a] + total[n] - total[b] + num;
        if (len1 < len2) {
            ans[i] = len1;
        }
        else {
            ans[i] = len2;
        }
    }
    for (int i = 0; i < m; i++) {
        printf("%d\n", ans[i]);
    }
    return 0;
}