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,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.
代码
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int n,m;
scanf("%d",&n);
int arr[n+1],dp[n+1],x,y,sum=0;
dp[0]=0;
for(int i=1;i<=n;i++){
scanf("%d",&arr[i]);
sum+=arr[i];
dp[i]=sum;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d%d",&x,&y);
if(x>y)swap(x,y);
int d=dp[y-1]-dp[x-1];
printf("%d\n",sum-d>d?d:sum-d);
}
return 0;
}