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.
Sample Input:
5 1 2 4 14 9
3
1 3
2 5
4 1
Sample Output:
3
10
7
题意:
给定一个圈,求一个端点到另一个端点值最小的情况
用递推法:正序和 = 端点递推值相减,逆序和 = 数列总和-端点递推值相减
#include <iostream>
#include <algorithm>
using namespace std;
int MaxArray[100010] = { 0 };
int main() {
int Nn,temp;
int sum = 0;
scanf("%d", &Nn);
for (int i = 1; i <= Nn; ++i) {
scanf("%d", &temp);
sum += temp;
MaxArray[i] = sum;
}
//递推法
int Nm;
int nleft, nright;
scanf("%d", &Nm);
for (int i = 0; i < Nm; ++i) {
scanf("%d %d", &nleft, &nright);
if (nleft > nright) swap(nleft, nright);
int res = MaxArray[nright - 1] - MaxArray[nleft - 1];
printf("%d\n", min(res,sum-res));
}
system("PAUSE");
return 0;
}