/\/\/\/

题目描述
A sequence a1,a2,…,an is said to be when the following conditions are satisfied:

For each i=1,2,…,n−2, ai=ai+2.
Exactly two different numbers appear in the sequence.
You are given a sequence v1,v2,…,vn whose length is even. We would like to make this sequence by replacing some of its elements. Find the minimum number of elements that needs to be replaced.

Constraints
2≤n≤105
n is even.
1≤vi≤105
vi is an integer.

输入
Input is given from Standard Input in the following format:

n
v1 v2 … vn

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int x[100005],y[100005];
int main()
{
    int j1=0,j2=0,o1=0,o2=0,a,b,c,d1=-1,d2=-1;
    cin>>a;
    for(b=0;b<a;b++)
    {
        scanf("%d",&c);
        if(b%2==0)
        {
            x[c]++;
            if(x[c]>j1)
            {
                if(c!=d2)
                {
                    j2=j1;
                    d2=c;
                }
                j1=x[c];

            }
            else if(x[c]>j2)
            {
                j2=x[c];
            }

        }
        else
        {
            y[c]++;
            if(y[c]>o1)
            {

                if(d1!=c)
                {
                    d1=c;
                    o2=o1;
                }
                o1=y[c];

            }
            else if(y[c]>o2)
            {
                o2=y[c];
            }
        }
    }
    if(d1==d2)
        cout<<min(a-j1-o2,a-j2-o1);
    else
        cout<<a-j1-o1;
    return 0;
}

//分别找出奇数序号最多的、第二多的以及最多的数字，偶数序号也一样，如果他们最多的数字相同，则输出min(a-j1-o2,a-j2-o1)，不同，输出a-j1-o2。