[PAT Advanced Level] 1046 Shortest Distance

最新推荐文章于 2024-10-16 00:00:43 发布

花花啊啦啦啦

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量88

点赞数

分类专栏： PAT 文章标签：算法图论

本文链接：https://blog.csdn.net/qq_44574200/article/details/119706129

版权

PAT 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

[PAT Advanced Level] 1046 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.

N个点围成一个圈，寻找给定两点的最短路径。

输入第一行为N个点间的距离，第一个数5表示第一个点与第二点间的距离；第二行为给定两点的对数；接下来依次是给定的两点，寻找每对的最短路径。

输出每对给定两点间的最短路径。
示例

输入：
5 1 2 4 14 9
3
1 3
2 5
4 1

输出：
3
10
7

题解

dis[i]存放1号节点按顺时针到达i+1号节点的距离，而不是通过A[i]存放的i号节点与i+1号节点的距离来进行路径查找，这样可以直接查询dis[right-1]-dis[left-1]寻得路径，而最短路径就是dis（left，right）与sum-dis(left,right)的较小值。

注意left可能会大于right，所以需要进行if判断，进行交换。

#include<cstdio>
#include<algorithm>
using namespace std;

const int MAXN=100005;      //dis[i]表示1号节点按顺时针方向到达i+1号节点
int dis[MAXN],A[MAXN];      //A[i]存放i号与i+1号顶点的距离
int main()
{
    int sum=0,query,n,left,right;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&A[i]);
        sum+=A[i];
        dis[i]=sum;
    }
    scanf("%d",&query);
    for(int i=0;i<query;i++)        //query个查询
    {
        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;
}