Submission #3816588

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;


typedef long long ll;
const int maxn = (int) 1e5 + 1;

int n;
int a, u[3][maxn], p[maxn], s[maxn], ans;
int main(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a;
        u[i % 2][a]++;
    }
    for(int i = 1; i <= 100000; i++){
        p[i] = max(p[i - 1], u[0][i]);
    }
    for(int i = 100000; i >= 1; i--){
        s[i] = max(s[i + 1], u[0][i]);
    }
    for(int i = 1; i <= 100000; i++){
        ans = max(ans, max(p[i - 1], s[i + 1]) + u[1][i]);
    }
    cout << n - ans;
}

Submission Info

Judge Result