Baekjoon #1874

Baekjoon #1874

1개의 풀이 · C++

문제 원문 보기 ↗

SOLUTION INFO

C++ · main.cpp

main.cpp
#include <bits/stdc++.h>

using namespace std;

int main(int argc, char** argv)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    int remain = 1;
    vector<int> stack;
    stack.reserve(N);

    vector<char> answer;
    answer.reserve(2 * N + 1);

    for (int n = 0; n < N; ++n) {
        int current;
        cin >> current;

        while (remain <= current) {
            stack.push_back(remain++);
            answer.push_back('+');
            answer.push_back('\n');
        }

        if (!stack.empty() && stack.back() == current) {
            stack.pop_back();
            answer.push_back('-');
            answer.push_back('\n');
        } else {
            answer.clear();
            answer.push_back('N');
            answer.push_back('O');
            answer.push_back('\n');
            break;
        }
    }

    // make c string
    answer.push_back(0);
    cout << answer.data();

    return 0;
}

SOLUTION DESCRIPTION

풀이 설명

등록된 풀이 설명이 없습니다.