1046 Shortest Distance (20分)

最新推荐文章于 2023-11-23 19:22:16 发布

air_shark

最新推荐文章于 2023-11-23 19:22:16 发布

阅读量93

点赞数

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/weixin_43307431/article/details/104201276

版权

PAT 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

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

作者: CHEN, Yue

单位: 浙江大学

时间限制: 200 ms

内存限制: 64 MB

代码长度限制: 16 KB

编译器 (31)--C++

#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;

int main()
{
    int n,m;
    int sum=0;
    vector<int> seq;
    vector<int> seq2;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        int p;
        scanf("%d",&p);
        sum+=p;
        seq.push_back(sum);
        seq2.push_back(p);
    }
    scanf("%d",&m);
    for(int i=0;i<m;i++)
    {
        int s,e;
        scanf("%d%d",&s,&e);
        if(s>e)
        {
            int t=s;
            s=e;
            e=t;
        }
        int num=seq[e-1]-seq2[e-1]-seq[s-1]+seq2[s-1];
        printf("%d\n",(num<(sum-num)?num:(sum-num)));
    }

    return 0;
}