PAT-A1046 Shortest Distance（模拟）

最新推荐文章于 2019-09-09 14:56:46 发布

wjzz

最新推荐文章于 2019-09-09 14:56:46 发布

阅读量405

点赞数

分类专栏： PAT 模拟

本文链接：https://blog.csdn.net/WeiJJ6608/article/details/50770561

版权

PAT 同时被 2 个专栏收录

78 篇文章 0 订阅

订阅专栏

模拟

22 篇文章 0 订阅

订阅专栏

这个题目容易超时，外循环最多10^4，内循环最多10^5，一共10^9.

超时的算法：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define MAX 100000+10
int cycle[MAX];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int N = 0;
    cin >> N;
    for (int i = 1; i <= N; i++)
    {
        cin >> cycle[i];
        cycle[i+N] = cycle[i];
    }
    int t = 0;
    cin >> t;
    while (t--)
    {
        int s = 0, e = 0, right = 0, left = 0;
        int m, n;
        cin >> s >> e;
        m = s<e?s:e;
        n = s<e?e:s;
        for (int i = m; i < n; i++)
            left += cycle[i];

        for (int i = n; i < m+N; i++)
            right += cycle[i];
        int mmin = right>left?left:right;
        cout << mmin << endl;
    }
    return 0;
}

正确算法：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define MAX 100000+10
int cycle[MAX];
int dis[MAX];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int N = 0, sum = 0;
    cin >> N;
    for (int i = 1; i <= N; i++)
    {
        cin >> cycle[i];
        sum += cycle[i];
        dis[i] = sum;
    }
    int t = 0;
    cin >> t;
    while (t--)
    {
        int s = 0, e = 0, right = 0, left = 0;
        int m, n;
        cin >> s >> e;
        m = s<e?s:e;
        n = s<e?e:s;

        left = dis[n-1] - dis[m-1];
        right = sum - left;

        int mmin = right>left?left:right;
        cout << mmin << endl;
    }
    return 0;
}