PAT甲级--A1046.Shortest Distance

最新推荐文章于 2022-01-08 17:19:46 发布

kiritojabel

最新推荐文章于 2022-01-08 17:19:46 发布

阅读量103

点赞数

分类专栏：算法笔记

本文链接：https://blog.csdn.net/kiritojabel/article/details/117267333

版权

算法笔记专栏收录该内容

2 篇文章 0 订阅

订阅专栏

题目：1046 Shortest Distance (20 分)

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 <cstdio>

int main()
{
    int N, M, a[100001] = { 0 }, b = 0, c = 0, sum = 0, all = 0;
    scanf("%d", &N);
    for (int i = 1; i <=N; i++) {
        scanf("%d", &a[i]);
        all += a[i];
    }
    scanf("%d", &M);
    for (int i = 1; i <= M; i++) {
        scanf("%d%d", &b, &c);
        if (b < c) {
            for (int j = b; j < c; j++) {
                sum += a[j];
            }
            if (sum > (all - sum)) {
                printf("%d\n", all - sum);
            }
            else {
                printf("%d\n", sum);
            }
            sum = 0;

        }
        else {
            for (int j = c; j < b; j++) {
                sum += a[j];
            }
            if (sum > (all - sum)) {
                printf("%d\n", all - sum);
            }
            else {
                printf("%d\n", sum);
            }
            sum = 0;

        }
    }
    return 0;
}

在极端情况下会超时！！！！

改进后的代码：

#include <cstdio>

int main()
{
    int N, M, a[100001] = { 0 }, dist[10001] = { 0 },b = 0, c = 0, sum = 0, all = 0;
    scanf("%d", &N);
    for (int i = 1; i <=N; i++) {
        scanf("%d", &a[i]);
        all += a[i];
        dist[i] = all;
    }
    scanf("%d", &M);
    for (int i = 1; i <= M; i++) {
        scanf("%d%d", &b, &c);
        if (b < c) {
            sum = dist[c - 1] - dist[b-1];
            if (sum > (all - sum)) {
                printf("%d\n", all - sum);
            }
            else {
                printf("%d\n", sum);
            }
            sum = 0;

        }
        else {
            sum = dist[b - 1] - dist[c - 1];
            if (sum > (all - sum)) {
                printf("%d\n", all - sum);
            }
            else {
                printf("%d\n", sum);
            }
            sum = 0;

        }
    }
    return 0;
}