1874 : 스택 수열 (Stack) [C++]

#include <iostream>

using namespace std;

class Stack
{
private:
 int Array[100000];
 int Top;
public:
 Stack(int n);
 void Push(int n);
 void Pop();
 int GetTop();
 int GetSize();
};

Stack::Stack(int n)
{
 Top = 0;
}

void Stack::Push(int n)
{
 Array[Top++] = n;
}

void Stack::Pop()
{ 
 Top--;
}

int Stack::GetTop()
{
 return Array[Top - 1];
}

int Stack::GetSize()
{
 return Top;
}

int main()
{
 int N;
 cin >> N;

 Stack Data(0);
 bool Digit[100000];
 
 for (int i = 0; i < 100000; i++)
  Digit[i] = true;

 int j_init = 1;

 for (int i = 0; i < N; i++)
 {
  int Temp;
  cin >> Temp;
  
  for (int j = j_init; j <= Temp; j++)
  {
   if (Digit[j - 1])
   {
    Data.Push(j);
    Digit[j - 1] = false;
    cout << "+" << endl;
   }
  }

  for (int j = Data.GetTop(); j >= Temp; j--)
  {
   Data.Pop();
   cout << "-" << endl;
  }

  j_init = Data.GetTop();
 }
}