Envío 811

Código

// 08
// https://codeo.app/problemas/0xcf-mirando-al-horizonte

#include <iostream>
#include <vector>

using namespace std;

struct Node
{
    int data;
    struct Node *next;
};

int searchBigger(int height, Node *node)
{
    while (node != nullptr)
    {
        if (node->data > height)
            return node->data;
        node = node->next;
    }
    return -1;
}

Node *insertAtBeginning(Node *node, int value)
{
    Node *tempNode = new Node;
    tempNode->data = value;
    tempNode->next = nullptr;

    if (node)
        tempNode->next = node;
    return tempNode;
}

// 2: linked list approach
void solveCase2(vector<int> buildings, int n)
{
    vector<int> answers(n);
    Node *head = nullptr;
    int biggerB;
    for (int i = n - 1; i >= 0; i--)
    {
        biggerB = searchBigger(buildings[i], head);
        if (head == nullptr || (head != nullptr && head->data != buildings[i]))
            head = insertAtBeginning(head, buildings[i]);

        answers[i] = biggerB;
    }
    for (int i = 0; i < n; i++)
        cout << answers[i] << " ";
}

// 1: brute force approach
void solveCase1(vector<int> buildings, int n)
{
    int biggerHeight;
    for (int i = 0; i < n; i++)
    {
        biggerHeight = -1;
        for (int j = i + 1; j < n; j++)
        {
            if (buildings[j] > buildings[i])
            {
                biggerHeight = buildings[j];
                break;
            }
        }
        cout << biggerHeight << " ";
    }
}

int main()
{
    int cases, n;
    vector<int> buildings;

    cin >> cases;
    for (int c = 1; c <= cases; c++)
    {
        // read buildings heights
        cin >> n;
        buildings = vector<int>(n);
        for (int i = 0; i < n; i++)
            cin >> buildings[i];

        // check for building hidding the horizon
        cout << "Case #" << c << ": ";
        solveCase2(buildings, n);
        cout << endl;
    }

    return 0;
}