BestCoder Sequence

Problem Description

Mr Potato is a coder.
Mr Potato is the BestCoder.

One night, an amazing sequence appeared in his dream. Length of this sequence is odd, the median number is M, and he named this sequence as Bestcoder Sequence.

As the best coder, Mr potato has strong curiosity, he wonder the number of consecutive sub-sequences which are bestcoder sequences in a given permutation of 1 ~ N.

 

Input

Input contains multiple test cases.
For each test case, there is a pair of integers N and M in the first line, and an permutation of 1 ~ N in the second line.

[Technical Specification]
1. 1 <= N <= 40000
2. 1 <= M <= N

 

Output

For each case, you should output the number of consecutive sub-sequences which are the Bestcoder Sequences.

 

Sample Input

1 1 1 5 3 4 5 3 2 1

 

Sample Output

1 3

 

题解：Bestcoder Sequences显然有个性质，如果令大于m的数为1，令小于m的数为-1，则( a[1]+a[2]+···+a[n] )=0;

例子：

5 3

4 5 3 2 1 <====> 1 1 0 -1 -1 ==>{3},{5 3 2},{4 5 3 2 1}其对应的和都为0。然后再将序列分为两部分，m的左

边和m的右边。如{4 5}和{2 1}，计算它们对应的序列的和，相反的一定能构成Bestcoder Sequences。具体看代码！因

为和存在是负数的情况，所以这里maxn相当于数轴上的0点。

#pragma warning(disable:4996)
#include<string>
#include<cstdio>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

const int maxn = 4e4 + 5;

int n, m;
int a[maxn], ans[2][2 * maxn];

int main()
{
    while (scanf("%d%d", &n, &m) != EOF) {

        memset(ans, 0, sizeof(ans));
        ans[0][maxn] = ans[1][maxn] = 1;

        int p, k;
        for (int i = 1; i <= n; i++) {
            scanf("%d", a + i);
            if (a[i] == m) p = i;
        }

        k = 0;
        for (int i = p + 1; i <= n; i++) {
            if (a[i] > m) k++;
            else k--;
            ans[1][k + maxn]++;
        }

        k = 0;
        for (int i = p - 1; i >= 1; i--) {
            if (a[i] > m) k++;
            else k--;
            ans[0][k + maxn]++;
        }

        k = 0;
        for (int i = -n; i <= n; i++) k += (ans[0][i + maxn] * ans[1][maxn - i]);
        printf("%d
", k);

    }
    return 0;
}