Srednji

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using ii=long long;
#define F first
#define S second
int main()
{
    int n, x;
    cin >> n >> x;
    vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    vector<int> d(n);
    int loc = find(all(v), x) - v.begin();
    int lol = 0;
    for (int i = loc - 1; i >= 0; --i) {
        if (v[i] > x) lol++;
        else lol--;
        d[i] = lol;
    }
    lol = 0;
    for (int i = loc + 1; i < n; ++i) {
        if (v[i] > x) lol++;
        else lol--;
        d[i] = lol;
    }
    map<int, int> m;
    for (int i = 0; i <= loc; ++i) {
        m[d[i]]++;
    }
    ii res = 0;
    for (int i = loc; i < n; ++i) {
        res += m[-d[i]];
    }
    cout << res << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED