1046. Shortest Distance (20)

1046. Shortest Distance (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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.

Sample Input:

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

Sample Output:

3
10
7

有N条边，接着给出1-2，2-3，3-4……n-1的长度（相当于一个环的各段长度）

接着给出M对要求的最少长度；

比如i ii；

这里DSum[x]存放的是1~x+1的长度，DSum[N]存放整条环长度；显然i到ii只有两条长度，两条长度和为环的长度；比较这两条得到其中最短的就可以了。

其中一条 i~ii ii>i ? DSum[ii] - DSum[i] : DSum[i] - DSum[ii]; 

评测结果
  
  
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
8月10日
 09:53
答案正确
20
1046
C++
 (g++ 4.7.2)
42
692
datrilla
测试点
  
  
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
308
14/14
1
答案正确
1
180
3/3
2
答案正确
42
692
3/3

#include<iostream>   
using namespace std;  
void readln(int*DSum, int N)
{
  int index;
  DSum[0] = 0;
  for (index = 1; index <= N; index++)
  {
    cin >> DSum[index];
    DSum[index] += DSum[index - 1];
  }
}
int main()
{  
  int N,M; 
  int*DSum;
  cin >> N;
  DSum = new int[N+1];
  readln(DSum, N);
  cin >> M;
  while(M--)
  {
    int i, ii,temp;
    cin >> i >> ii; 
    i--; 
    ii--;
    temp = ii>i ? DSum[ii] - DSum[i] : DSum[i] - DSum[ii];
    cout << (temp < DSum[N] - temp ? temp : DSum[N] - temp)<< endl;
  }
  delete[]DSum;
  system("pause");
  return 0;
}