Description
给出
1
~
Input
第一行为两个正整数
Output
输出一个整数,即中位数为
Sample Input
7 4
5 7 2 4 3 1 6
Sample Output
4
HINT
第三个样例解释:{4}, {7,2,4}, {5,7,2,4,3}和{5,7,2,4,3,1,6}
N⩽100000
Solution
显然要求子序列中大于
b
的个数等于小于
#include<bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, flag = 1; char ch = getchar();
while (ch > '9' || ch < '0') { if (ch == '-') flag = -1; ch = getchar(); }
while (ch <= '9' && ch >= '0') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * flag;
}
inline void write(int x) { if (x >= 10) write(x / 10); putchar(x % 10 + '0'); }
#define N 100001
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define drp(i, a, b) for (int i = a; i >= b; i--)
int n, b, a[N];
int num[N];
int l[N << 1], r[N << 1];
int main() {
cin >> n >> b;
int pos = 0, sum, ans;
rep(i, 1, n) {
a[i] = read();
if (a[i] == b) pos = i, num[i] = 0;
else if (a[i] < b) num[i] = -1;
else num[i] = 1;
}
l[n] = r[n] = 1;
sum = 0; drp(i, pos - 1, 1) sum += num[i], l[sum + n]++;
sum = 0; rep(i, pos + 1, n) sum += num[i], r[sum + n]++;
ans = 0; rep(i, 0, (n << 1) - 1) ans += l[i] * r[2 * n - i];
write(ans);
return 0;
}