BestCoder Round #3 BestCoder Sequence

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<string>
#include<stack>
#include<set>
#define ll long long
#define MAX 40010
#define INF INT_MAX
#define eps 1e-8

using namespace std;

int a[MAX],endx[MAX],endy[MAX],begx[MAX],begy[MAX];

multiset<int>S,T;

int main(){
	int n,m;
	while (scanf("%d%d",&n,&m) != EOF){
		int u,ans = 0;
		S.clear();
		T.clear();
		memset(endx,0,sizeof(endx));
		memset(endy,0,sizeof(endy));
		memset(begx,0,sizeof(begx));
		memset(begy,0,sizeof(begy));
		for (int i=1; i<=n; i++){
			 scanf("%d",&a[i]);
			 if (a[i] == m){
			 	u = i;
			 }
		}
		for (int i=u-1; i>0; i--){
			if (a[i] < m){
				begx[i] = begx[i+1] + 1;
				begy[i] = begy[i+1];
			}
			else{
				begx[i] = begx[i+1];
				begy[i] = begy[i+1]+1;
			}
			S.insert(begx[i] - begy[i]);
			if (begx[i] - begy[i] == 0) ans++;
		}
		for (int i=u+1; i<=n; i++){
			if (a[i] < m){
				endx[i] = endx[i-1] + 1;
				endy[i] = endy[i-1];
			}
			else{
				endx[i] = endx[i-1];
				endy[i] = endy[i-1] + 1;
			}
			T.insert(endx[i] - endy[i]);
			if (endx[i] - endy[i] == 0) ans++;
		}
		multiset<int>::iterator it;
		for (it = S.begin(); it != S.end(); it++){
			int e = *it;
			//printf("e = %d\n",e);
			ans += T.count(-e);
		}
		printf("%d\n",ans+1);		
	}
	return 0;
}