[BestCoder Round #3] hdu 4908 BestCoder Sequence (计数)
Posted yfceshi
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[BestCoder Round #3] hdu 4908 BestCoder Sequence (计数)相关的知识,希望对你有一定的参考价值。
BestCoder Sequence
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.
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
1 1 1 5 3 4 5 3 2 1
1 3HintFor the second case, {3},{5,3,2},{4,5,3,2,1} are Bestcoder Sequence.
题意为 给定一个1 -N的排列,再给定一个数M(1<=M<=N)。问有多少连续的长度为奇数子序列,使得M在当中为中位数(M在子序列中)。
比方例子
5 3
4 5 3 2 1 N=5, M=3
{3},{5,3,2},{4,5,3,2,1} 为符合题意的连续子序列....
当时做的时候把包括M的全部长度为0,1,2.......的连续子序列都枚举了出来。然后推断推断M是否是中位数。结果 果断超时.......
贴一下题解思路:
写了一堆字,CSDN的排版太....了,贴图片把.
代码:
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; const int maxn=40010; int sum[maxn]; int cnt[maxn*2]; int n,m; int val,p; int main() { while(scanf("%d%d",&n,&m)==2) { sum[0]=0; for(int i=1;i<=n;i++) { sum[i]=sum[i-1]; scanf("%d",&val); if(val<m) sum[i]--; else if(val>m) sum[i]++; else p=i; } memset(cnt,0,sizeof(cnt)); for(int i=0;i<p;i++) cnt[sum[i]+maxn]++; int ans=0; for(int i=p;i<=n;i++) ans+=cnt[sum[i]+maxn]; printf("%d\n",ans); } return 0; }
以上是关于[BestCoder Round #3] hdu 4908 BestCoder Sequence (计数)的主要内容,如果未能解决你的问题,请参考以下文章
BestCoder Round #77 (div.2)(hdu5650,hdu5651(逆元),hdu5652(二分),hdu5653(dp))
[BestCoder Round #3] hdu 4907 Task schedule (模拟简单题)
BestCoder Round #69 (div.2)(hdu5611)
BestCoder Round #66 (div.2) hdu5592
BestCoder Round #73 (div.2)(hdu 5630)
HDU5638 / BestCoder Round #74 (div.1) 1003 Toposort 线段树+拓扑排序