HDU 4908——BestCoder Sequence

最新推荐文章于 2016-08-07 11:41:22 发布

fa茶

最新推荐文章于 2016-08-07 11:41:22 发布

阅读量1.2k

点赞数

分类专栏： # BestCoder

本文链接：https://blog.csdn.net/u014141559/article/details/38364655

版权

BestCoder 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

BestCoder Sequence

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

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

Sample Output

  
  
   
   1
3


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

————————————————————————————————————————————

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define M 100001
#define base 40000
using namespace std;
int a[M],dp[M];
int main()
{
    int n,m,x;
    while(scanf("%d%d",&n,&m)!=EOF){
        for(int i=0;i<n;++i){
            scanf("%d",&a[i]);
            if(a[i]==m) x=i;
        }
        memset(dp,0,sizeof dp);
        int ans=0;
        for(int i=x+1;i<n;++i){
            if(a[i]>m) ans++;  //大的加小的减
            else ans--;
            dp[ans+base]++;    //记录出现该状态的次数
        }
        ans=++dp[base];//当状态数为base，才满足中位数
        int tmp=0;
        for(int i=x-1;i>=0;--i){
            if(a[i]>m) tmp++;
            else tmp--;
            ans+=dp[-tmp+base];//状态相加为base的个数
        }
        cout<<ans<<endl;
    }
    return 0;
}