Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define endl '\n'
- int A[111111];
- long long CL[222222];
- int main( void ) {
- long long ans = 0;
- int F[111111];
- int n,b;
- cin >> n >> b;
- for (int i = 0; i < n; i++) {
- cin >> A[i];
- F[A[i]] = i;
- }
- int l = 0;
- CL[111111] = 1;
- for (int i = F[b]+1; i < n; i++) {
- if (A[i] > b) l++;
- else l--;
- CL[l+111111]++;
- }
- int r = 0;
- for (int i = F[b]; i >= 0; i--) {
- if (i != F[b]) {
- if (A[i] > b) r--;
- else r++;
- }
- ans += CL[r+111111];
- }
- cout << ans << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement