题目描述:传送门
题解:前缀和水题,个人做法比较傻逼。。。
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
const int maxn=100005;
int n,m,a[maxn],s[maxn];
long long ans;
map<int,int> hsh,hshj,hsho;
inline int read(){
int x=0; char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-48,ch=getchar();
return x;
}
int main(){
n=read(),m=read();
for (int i=1;i<=n;i++) {a[i]=read(); if (a[i]<m) a[i]=-1; else if (a[i]>m) a[i]=1; else a[i]=0;}
for (int i=1;i<=n;i++) s[i]=s[i-1]+a[i];
for (int i=1;i<=n;i++)
if (i%2==1) {ans+=hsho[s[i]]; if (s[i]==0) ans++; hshj[s[i]]++;}
else {ans+=hshj[s[i]]; hsho[s[i]]++;}
printf("%d\n",ans);
return 0;
}