# 【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 FORMAT

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 FORMAT

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

## 解题思路

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<algorithm>
#define INF 99999999
using namespace std;
int N,sum[100010],M;
int main(){
scanf("%d",&N);
int a;
for(int i=1;i<=N;i++){
scanf("%d",&a);
sum[i]=sum[i-1]+a;
}
scanf("%d",&M);
int pre,pro;
for(int i=0;i<M;i++){
scanf("%d%d",&pre,&pro);
int temp=abs(sum[pro-1]-sum[pre-1]);
printf("%d\n",min(temp,sum[N]-temp));
}
return 0;
}



• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120