Submission #6889666

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;



int main() {
  //
  int N;
  string c;
  cin >> N;
  cin >> c;

  vector<int> frqs(4, 0);
  for (int i = 0; i < N; ++i) {
    int j = stoi(c.substr(i, 1)) - 1;
    frqs[j]++;
  }

  //
  cout << *max_element(frqs.begin(), frqs.end());
  cout << " " << *min_element(frqs.begin(), frqs.end()) << endl;



  return 0;
}

Submission Info

Judge Result