HDOJ 题目4096 BestCoder Sequence（数学，水）

BestCoder Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1095    Accepted Submission(s): 376

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


   
   

    
    

     
     Hint
    
    
For the second case, {3},{5,3,2},{4,5,3,2,1} are Bestcoder Sequence.

   
   
   
    
  
  

 

Source

BestCoder Round #3

 

Recommend

We have carefully selected several similar problems for you:   5169  5168  5167  5166  5165 

题目大意：给个n,m,然后输入一个含n个数的数列，问这个数列的子数列中有几个中位数是m

ac代码

#include<stdio.h>
#include<string.h>
#define max 40004
int d[max*2],a[max];
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int i,p,cot=0,ans;
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==m)
				p=i;
		}
		memset(d,0,sizeof(d));
		for(i=p;i>=0;i--)
		{
			if(a[i]>m)
				cot++;
			if(a[i]<m)
				cot--;
			d[max+cot]++;
		}
		cot=0;
		ans=0;
		for(i=p;i<n;i++)
		{
			if(a[i]>m)
				cot++;
			if(a[i]<m)
				cot--;
			ans+=d[max-cot];
		}
		printf("%d\n",ans);
	}
}