PAT甲级 1046 Shortest Distance(20) (前缀和)

NHS6671

已于 2022-05-26 18:34:14 修改

阅读量114

点赞数

分类专栏： PAT-甲级文章标签：职场和发展 c++ 算法 pat考试数据结构

于 2022-05-26 12:44:59 首次发布

本文链接：https://blog.csdn.net/NHS6671/article/details/124982279

版权

PAT-甲级专栏收录该内容

70 篇文章 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.

输入

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 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 (≤ $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}$ .

输出

For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.

样例输入

5 1 2 4 14 9
3
1 3
2 5
4 1

样例输出

3
10
7

题意理解

给你n条边 m个询问是一个环形的高速公路让你求出两点之间的最短距离也就是你可以从这头顺时针跑或者逆时针跑问最短距离是多少

n个点 n条边刚刚好是一个环

先来理解一下样例

1->2 距离是1

2->3 距离是2

3->4 距离是4

4->5 距离是14

5->1 距离是9

那么 1 3的询问最短距离就是3 顺时针的方向

2 5的询问就是10 逆时针方向

4 1的询问就是7 顺时针方向

那么我们采用前缀和的思想

把整个距离都记录下来然后通过预处理的前缀和查询两点之间的距离

sum是跑个循环的距离两点之间的距离用前缀和记录反方向的用整个的距离减去前缀和的记录的顺时针距离两者取一个 $Min$ 就是我们最后的最短距离

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+10;
LL a[N],b[N];
LL sum=0,x;
int n,m;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&x);
        a[i]=x;
        b[i]=b[i-1]+a[i];
        sum+=x;
    }
    scanf("%d",&m);
    while(m--){
        int a1,b1;
        scanf("%d%d",&a1,&b1);
        LL nu=abs(b[b1-1]-b[a1-1]);
        printf("%lld\n",min(nu,sum-nu ) );
    }
    return 0;
}