1046. Shortest Distance (20)-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, 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

解题代码  

方法1

C++

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n;
    scanf("%d", &n);
    vector<int> dis(n + 1);
    int sum = 0, left, right, cnt;
    for(int i = 1; i <= n; i++) {
        int temp;
        scanf("%d", &temp);
        sum += temp;
        dis[i] = sum;
    }
    scanf("%d", &cnt);
    for(int i = 0; i < cnt; i++) {
        scanf("%d %d", &left, &right);
        if(left > right)
            swap(left, right);
        int temp = dis[right - 1] - dis[left - 1];
        printf("%d\n", min(temp, sum - temp));
    }
    return 0;
}

方法二

#include <iostream>
#include<cstdio>
using namespace std;
int main() {
    freopen("data.in","r",stdin);
    int n;
    cin>>n;
    int dis[100];
    for(int i=1;i<=n;i++)
        cin>>dis[i];
    int m;
    int exit1,exit2;
    cin>>m;
    while(m--)
    {
        int t1=0,t2=0;
        cin>>exit1>>exit2;
        for(int i=exit1;i!=exit2;)
        {
            t1+=dis[i];
            i=i%n+1;
        }  //从开始到结束顺时针
       for(int i=exit2;i!=exit1;)
        {
            t2+=dis[i];
            i=i%n+1;
        }  //从结束到开始，模拟开始到结束的逆时针
        printf("%d\n",(t1<t2)?t1:t2);
    }
}