《算法笔记》3.1小节——入门模拟->简单模拟—

本文链接：https://blog.csdn.net/jack_wzl/article/details/105149157

题目描述

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

题目意思是求一个环形路线两节点之间的最短距离

思路：最开始是想累加，用一个变量将总距离求出，然后求两节点顺时针距离，然后用总距离减去顺时针距离即可求得逆时针距离，然后比较，小的即为最短距离。但提交之后超时！只能另寻它路，发现环形路线的总距离是可求的，A到B之间的距离等于（A到0距离）减去（B到0距离），任意节点到0的距离都可以在输入时求出。

代码如下

#include<stdio.h>
int main()
{
    int n,i,total = 0;
    scanf("%d",&n);
    int a[n],d;
    for(i = 0;i <n; i++){
        scanf("%d",&d);
        a[i+1] = total;//每个节点到初始位置的距离
        total += d;//环形路线的总距离
    }
    int m,start,end,sum;
    scanf("%d",&m);
    for(i = 0;i < m; i++){
        scanf("%d%d",&start,&end);
        if(start>end){
            sum = a[start]-a[end];//两个节点之间的距离
        }
        else{
            sum = -a[start]+a[end];
        }
        if(total - sum > sum)
            printf("%d\n",sum);
        else
            printf("%d\n",total-sum);
    }
    return 0;
}