hdu4908 & BestCoder Round #3 BestCoder Sequence(组合数学)
来源:互联网 发布:访客网络怎么隐藏 编辑:程序博客网 时间:2024/05/18 06:27
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4908
BestCoder Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 618 Accepted Submission(s): 214
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 asBestcoder Sequence.
As the best coder, Mr potato has strong curiosity, he wonder the number of consecutive sub-sequences which arebestcoder sequences in a given permutation of 1 ~ N.
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 asBestcoder Sequence.
As the best coder, Mr potato has strong curiosity, he wonder the number of consecutive sub-sequences which arebestcoder 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
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 theBestcoder Sequences.
Sample Input
1 115 34 5 3 2 1
Sample Output
13HintFor 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: 4910 4909 4906 4904 4903
题意:给定N和M,N为序列的长度,由1~N组成,求有多少连续的子序列是以M为中位数,且长度为奇数。
代码如下:
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define mid 40000#define MAXN 100017int dp[MAXN], num[MAXN];void init(){memset(dp,0,sizeof(dp));memset(num,0,sizeof(num));}int main(){int n, m;int i, j;while(~scanf("%d%d",&n,&m)){init();int t = 0;for(i = 1; i <= n; i++){scanf("%d",&num[i]);if(num[i] == m)//记录m位置t = i;}int cont = 0;for(i = t+1; i <= n; i++){if(num[i] > m)//大的加cont++;else //小的减cont--;dp[cont+mid]++;//记录出现该状态的次数}cont = ++dp[mid];//当状态数为mid,才满足中位数int tt = 0;for(i = t-1; i >= 1; i--){if(num[i] > m)tt++;elsett--;cont+=dp[-tt+mid];//状态相加为mid的个数}printf("%d\n",cont);}return 0;}
再贴一张和上面思路相同但做法不同的代码(系转载)
将大于M的数标记为1,小于M的数标记为-1,M本身标记
为0,则题目就是要求和为0并且包括M的连续序列的个数;
用sum_i表示从第一个数到第i个数的标记的和,对于所有大
于等于M的位置的i,我们要求小于M的位置的sum_j
== sum_i的个数的和即为答案。
为0,则题目就是要求和为0并且包括M的连续序列的个数;
用sum_i表示从第一个数到第i个数的标记的和,对于所有大
于等于M的位置的i,我们要求小于M的位置的sum_j
== sum_i的个数的和即为答案。
代码如下:
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define MAXN 50000using namespace std;int num[MAXN+10],sum[MAXN+10],a[MAXN+10+MAXN];int main(){ int M,N,M_id; while (scanf("%d %d",&N,&M)!=EOF) { memset(a,0,sizeof(a)); memset(sum,0,sizeof(sum)); memset(num,0,sizeof(num)); num[0]=sum[0]=0; for (int i=1;i<=N;i++) { int tmp; scanf("%d",&tmp); if (tmp>M) num[i]=1; else if (tmp==M) num[i]=0,M_id=i; else num[i]=-1; sum[i]=sum[i-1]+num[i]; } int cnt=0; for (int j=0;j<=M_id-1;j++) a[sum[j]+MAXN]++; for (int i=M_id;i<=N;i++) cnt+=a[sum[i]+MAXN]; printf("%d\n",cnt); } return 0;}
1 0
- hdu4908 & BestCoder Round #3 BestCoder Sequence(组合数学)
- HDU4908 - BestCoder Sequence(BestCoder Round #3 计数)
- HDU4908 BestCoder Sequence
- BestCoder Round #3 BestCoder Sequence
- [BestCoder Round #3] hdu 4908 BestCoder Sequence (计数)
- BestCoder Round #3 1002 BestCoder Sequence
- HDU 4908 BestCoder Sequence(组合数学)
- hdu 4908 BestCoder Sequence && BestCoder Round #3 1002
- HDU 4908 BestCoder Sequence——BestCoder Round #3
- 考试模拟1 BestCoder Round #3 BestCoder Sequence
- BestCoder Round #70(A)数学
- BestCoder Round #861001Price List(数学)
- 【索引】BestCoder Round #3
- BestCoder Round #3
- BestCoder Round #3 小记
- [BestCoder] Round #3
- BestCoder Round #3
- HDOJ 题目4096 BestCoder Sequence(数学,水)
- Message Flood(STL)
- Activity生命周期状态
- SQL server2005服务器登录名、角色、数据库用户、角色、架构的关系
- 使用libjpeg 压缩yuv420到jpg (内存方式)
- Android中dispatchTouchEvent, onInterceptTouchEvent, onTouchEvent浅谈
- hdu4908 & BestCoder Round #3 BestCoder Sequence(组合数学)
- 刚写的 软件 求大家评论一下 看看 效果 后期抽空写个软件的教程
- 解決 SQL Server 檢視表 (Views) 無法匯入 EDMX 的問題
- Hibernate_1_环境的配置
- Linux环境变量的设置和查看方法
- more/less/head/tail
- 精通css(3) 盒模型,定位,浮动
- java 重载和重写区别
- CURL实现HTTP的GET POST方法