Submission #5907228

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >=0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
 
typedef long long ll;
#define INF 1e9
 
 
int main(){
  int n;
  cin >> n;
  vector<int> a(n/2), b(n/2);
  REP(i, n){
     if(i % 2){
        cin >> b[i/2];
     }
     else{
        cin >> a[i/2];
     }
  }
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  vector<pair<int, int>> ac, bc;
  int cnt = 0, pre = -1;
  int ansa = 0, ansb = 0;
  REP(i, n/2){
     if(pre != a[i]){
        pre = a[i];
        cnt = 1;
         ac.push_back(make_pair(cnt, pre));
     }
     else{
        cnt++;
        ac[ac.size()-1].first++;
     }
      ansa = max(ansa, cnt);
  }
  cnt = 0;
  pre = -1;
  REP(i, n/2){
     if(pre != b[i]){
        pre = b[i];
        cnt = 1;
        bc.push_back(make_pair(cnt, pre));
     }
     else{
        cnt++;
        bc[bc.size()-1].first++;
     }
     ansb = max(ansb, cnt);
  }
  int ans;
   sort(ac.begin(), ac.end());
   sort(bc.begin(), bc.end());
   if(ac[ac.size()-1].second == bc[bc.size()-1].second){
      if(ac.size()==1 || bc.size()==1){
         if(ac.size()==1 && bc.size() == 1){
            ans = max(ac[ac.size()-1].first, bc[bc.size()-1].first);
            //cout << ac[ac.size()-1].first << " " << bc[bc.size()-1].first << " " << ans << endl;
         }
         else if(ac.size() == 1){
            ansa = ac[ac.size()-1].first;
            ansb = bc[bc.size()-2].first;
            ans = ansa+ansb;
         }
         else{
            ansb = ac[ac.size()-2].first;
            ansb = bc[bc.size()-1].first;
            ans = ansa+ansb;
         }
         
      }
      else{
         ans = max(ac[ac.size()-1].first+bc[bc.size()-2].first, ac[ac.size()-2].first+bc[bc.size()-1].first);
      }
   }
   else{
      ans = ac[ac.size()-1].first+bc[bc.size()-1].first;
   }
   //cout << n << " " << ans << endl;
   cout << n-ans << endl;

  return 0;
}

Submission Info

Judge Result