1046 Shortest Distance (20分)

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,10⁵]), followed by N integer distances D₁ D₂ ⋯ 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⁴), 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⁷.

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

exits：出口；
the total round trip distance：总往返距离；

思路

步骤1： s[]数组表示 1 号结点按顺时针方向到达“ i 号结点顺时针方向的下一个结点”的距离。a[i]存放 i 号与 i+1 号顶点的距离；
步骤2： s数组和sum在读入时就可以累加得到。这样可以做到查询复杂度为O(1)。

注意点

1、查询编号可能出现l>r的情况；

参考代码

#include<iostream>
using namespace std;
const int N = 100010;
int d[N],s[N];//d[i]存放 i 号与 i+1 号顶点的距离,s[]数组表示1号结点按顺时针方向到达“i号结点顺时针方向的下一个结点”的距离。
int main()
{
    //输入+处理
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&d[i]);
        s[i]=s[i-1]+d[i];
    }
    int sum=s[n];
    //运算+输出
    int m;
    scanf("%d",&m);
    while(m--){
        int l,r;
        scanf("%d%d",&l,&r);
        if(l>r)swap(l,r);
        int res=s[r-1]-s[l-1];
        printf("%d\n",min(res,sum-res));
    }
    return 0;
}