[USACO 2009 Mar S] Look Up

最新推荐文章于 2024-03-26 08:41:30 发布

小白兔奶糖ovo

最新推荐文章于 2024-03-26 08:41:30 发布

阅读量364

点赞数

文章标签： c++ c语言算法

本文链接：https://blog.csdn.net/qq_54053990/article/details/122477829

版权

算法初步专栏收录该内容

45 篇文章 2 订阅

订阅专栏

来源：牛客网

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 32768K，其他语言65536K
64bit IO Format: %lld

题目描述

Farmer John’s N (1 <= N <= 100,000) cows, conveniently numbered 1…N, are once again standing in a row. Cow i has height Hi (1 <= Hi <= 1,000,000).
Each cow is looking to her left toward those with higher index numbers. We say that cow i ‘looks up’ to cow j if i < j and Hi < Hj. For each cow i, FJ would like to know the index of the first cow in line looked up to by cow i.
Note: about 50% of the test data will have N <= 1,000.

输入描述:

Line 1: A single integer: N
Lines 2…N+1: Line i+1 contains the single integer: Hi

输出描述:

Lines 1…N: Line i contains a single integer representing the smallest index of a cow up to which cow i looks. If no such cow exists, print 0.

示例1

输出

说明

FJ has six cows of heights 3, 2, 6, 1, 1, and 2. Cows 1 and 2 both
look up to cow 3; cows 4 and 5 both look up to cow 6; and cows 3 and 6
do not look up to any cow.

WA:

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define maxn 1010
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    queue<int> q;
    int arr[maxn];
    cin >> n;
    for (int i = 0; i < n;i++)
    {
        cin >> arr[i];
    }
    q.push(arr[0]);
    for (int i = 0; i < n - 1;i++)
    {
        if(arr[i] > arr[i + 1])
        {
            q.push(arr[i]);
        }
        if(arr[i] == arr[i + 1])
        {
                q.push(arr[i - 1]);
        }
        if(arr[i] < arr[i + 1])
        {
            q.push(0);
        }
    }
    while(!q.empty())
    {
        cout << q.front() << endl;
        q.pop();
    }
    return 0;
}

After reading the questions hastily, I will directly look at the test cases!

AC：

[1]

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int a[100001], s[100001], res[100001], top;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = n; i >= 0; i--)
    {
        while (top && a[s[top]] <= a[i])
            top--;
        res[i] = s[top];
        s[++top] = i;
    }
    for (int i = 1; i <= n; i++)
        cout << res[i] << endl;
    return 0;
}

[2]

#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
int a[100001], s[100001], top;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    stack<int> q;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = n; i >= 0; i--)
    {
        while (top && a[s[top]] <= a[i])
            top--;
        q.push(s[top]);
        s[++top] = i;
    }
    q.pop();
    while(!q.empty())
    {
        cout << q.top() << endl;
        q.pop();
    }
    return 0;
}