提出 #29544070

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
void check(int &state, int &state_count,stack<int> &s,stack<int> &s_counts){
  if (state == s.top()){
    ++state_count;
    s_counts.push(state_count);
    if (state_count == state){
      for (int j=0; j<state; ++j){
        s.pop();
        s_counts.pop();
      };
      state_count = s_counts.top();
      state = s.top();
    }
  }
  else{
    state = s.top();
    state_count=1;
    s_counts.push(state_count);
  }
}

int main() {
  int N, n, state, state_count;
  cin >> N;
  stack<int> s;
  stack<int> s_counts;
  s_counts.push(1);
  state_count = 1;
  state = 1;
  s.push(1);
  
  for (int i=1;i<=N;++i){
    cin >> n;
    s.push(n);
    check(state, state_count, s, s_counts);
    cout << s.size()-1 << endl;
  }
  return 0;
}

提出情報

ジャッジ結果