RT

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[110000];
    cin>>n; 
    multiset<int> m;
    vector<int> b;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        m.insert(a[i]);
        b.push_back(a[i]);
    }
    unique(b.begin(),b.end());
    if(b.size()==1)cout<<0;
    else cout<<n-m.count(a[1])-m.count(a[n]);
    return 0;
}

玄关