算法笔记Shortest Distance
算法笔记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.
输入
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.
输出
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
using namespace std;const int N=1e5+3;int main(){int n;int sum=0;int dis[N]={0};int temp;scanf("%d",&n);for(int i=2;i<=n;i++){scanf("%d",&temp);sum+=temp;dis[i]=sum;}scanf("%d",&temp);sum+=temp;dis[1]=sum;int m;scanf("%d",&m);for(int i=0;i 写给自己：这题数据范围比较大，之前是因为第二个FOR循环里面又有了个FOR循环，所以超时，此题诀窍在于预处理一下距离。
本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！