#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 9973
#define N 70
typedef long long ll;
const int M=20005;
int n,m;
int sx,sy,sz;
char mp[M];
int pa[M],rankk[M];
int dp[M*2];
int head[M*6],vis[M*6];
double dis[M][10];
int g[5][5];
int lowcost[M],closet[M];
char st1[5050],st2[5050],str[600][600];
int len[M*6];
//pair<int ,int> a[M];
struct node
{
int st,s;
}group[M];
bool cmp(node a,node b)
{
if(a.st!=b.st)
return a.st<b.st;
return a.s<b.s;
}
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
bool isrun(int year)
{
if((year%4==0&&year%100!=0)||(year%400==0))
return true;
return false;
}
int a[2*M];
int main()
{
int i,tip,tol,tol2,ans;
while(~scanf("%d%d",&n,&m))
{
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]==m)
tip=i;
}
tol=0;
for(i=tip;i>=0;i--)
{
if(a[i]!=m)
{if(a[i]>m)
tol++;
else tol--;
}
dp[M-tol]++;//前边统计小的(tol<0),是M-tol
}
tol2=0,ans=0;
for(i=tip;i<n;i++)
{
if(a[i]!=m)
a[i]>m?tol2++:tol2--;
ans+=dp[M+tol2];//后边统计大的(tol2>0),是M+tol2
}
printf("%d\n",ans);
}
return 0;
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 9973
#define N 70
typedef long long ll;
const int M=20005;
int n,m;
int sx,sy,sz;
char mp[M];
int pa[M],rankk[M];
int dp[M*2];
int head[M*6],vis[M*6];
double dis[M][10];
int g[5][5];
int lowcost[M],closet[M];
char st1[5050],st2[5050],str[600][600];
int len[M*6];
//pair<int ,int> a[M];
struct node
{
int st,s;
}group[M];
bool cmp(node a,node b)
{
if(a.st!=b.st)
return a.st<b.st;
return a.s<b.s;
}
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
bool isrun(int year)
{
if((year%4==0&&year%100!=0)||(year%400==0))
return true;
return false;
}
int a[2*M];
int main()
{
int i,tip,tol,tol2,ans;
while(~scanf("%d%d",&n,&m))
{
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]==m)
tip=i;
}
tol=0;
for(i=tip;i>=0;i--)
{
if(a[i]!=m)
{if(a[i]>m)
tol++;
else tol--;
}
dp[M-tol]++;//前边统计小的(tol<0),是M-tol
}
tol2=0,ans=0;
for(i=tip;i<n;i++)
{
if(a[i]!=m)
a[i]>m?tol2++:tol2--;
ans+=dp[M+tol2];//后边统计大的(tol2>0),是M+tol2
}
printf("%d\n",ans);
}
return 0;
}
以k为中心向两边计数