编程介的小学生 2019-01-05 23:49 采纳率: 0.4%
浏览 282
已采纳

最佳连续的子序列数的计算问题,采用C语言如何实现解决?

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

  • 写回答

1条回答 默认 最新

  • threenewbee 2019-11-30 23:39
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?