B - Gold Balanced Lineup解题报告(张浩盛伦)

转载 2012年03月21日 13:54:19

B - Gold Balanced Lineup
Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

Farmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has been able to narrow down the list of features shared by his cows to a list of only K different features (1 ≤ K ≤ 30). For example, cows exhibiting feature #1 might have spots, cows exhibiting feature #2 might prefer C to Pascal, and so on.

FJ has even devised a concise way to describe each cow in terms of its "feature ID", a single K-bit integer whose binary representation tells us the set of features exhibited by the cow. As an example, suppose a cow has feature ID = 13. Since 13 written in binary is 1101, this means our cow exhibits features 1, 3, and 4 (reading right to left), but not feature 2. More generally, we find a 1 in the 2^(i-1) place if a cow exhibits feature i.

Always the sensitive fellow, FJ lined up cows 1..N in a long row and noticed that certain ranges of cows are somewhat "balanced" in terms of the features the exhibit. A contiguous range of cows i..j is balanced if each of the K possible features is exhibited by the same number of cows in the range. FJ is curious as to the size of the largest balanced range of cows. See if you can determine it.

Input

Line 1: Two space-separated integers, N and K
Lines 2..N+1: Line i+1 contains a single K-bit integer specifying the features present in cow i. The least-significant bit of this integer is 1 if the cow exhibits feature #1, and the most-significant bit is 1 if the cow exhibits feature #K.

Output

Line 1: A single integer giving the size of the largest contiguous balanced group of cows.

Sample Input

7 3
7
6
7
2
1
4
2

Sample Output

4

Hint

In the range from cow #3 to cow #6 (of size 4), each feature appears in exactly 2 cows in this range

题目链接:http://poj.org/problem?id=3274
解法类型:hash
解题思路:一道hash题啊,找key啊。当时做的时候觉得hash不好用,但它就是可以用hash优化,参考了一下别人的算法,让我对hash有了更深的领悟。首先把数转化成二进制矩阵,然后用一个数组s[i][j]来储存第j列的前i个数二进制的和,再用一个数组c[i][j]=s[i][j]-s[i][0],这样,只要某两行c[i][j]相同,那么这两行就可以算成一个contiguous balanced group。key就出来了,求和再取余或相乘再取余,随你。。~
算法实现:

//STATUS:C++_AC_969MS_27536K
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const int MAXN=100010,MAX_HASH=99991;
int s[MAXN][30],c[MAXN][30];
int count(int a,int b);
int k;
struct NODE     //链表写hash表
{
	struct NODE(){next=NULL;};
	int num;
	NODE *next;
}hash[MAX_HASH];
int main()
{
//	freopen("in.txt","r",stdin);
	int i,j,a,n,sumc,max;
	while(~scanf("%d%d",&n,&k))
	{
		max=0;
		memset(s,0,sizeof(s));
		memset(hash,0,sizeof(hash));
		NODE *p=(NODE*)malloc(sizeof(NODE));
		hash[0].num=0,hash[0].next=p,p->next=NULL;   //这个很重要,因为要考虑第一组的情况

		for(i=1;i<=n;i++){
		    scanf("%d",&a);
			for(j=0,sumc=0;j<k;j++){
		     	s[i][j]=s[i-1][j]+((a&(1<<j))?1:0);	   //位运算二进制

				c[i][j]=s[i][j]-s[i][0];
				sumc+=c[i][j];
			}

			int t=sumc%MAX_HASH;
			if(t<0)t=-t;
			NODE *p=&hash[t];
			for(;p->next!=NULL;p=p->next){    //搜索hash表
				int ok=count(p->num,i);
				if(ok!=-1 && ok>max)max=ok;
			}	
			NODE *q=(NODE*)malloc(sizeof(NODE));   //搜索hash表
			p->num=i;
			p->next=q;
			q->next=NULL;
		}			
		printf("%d\n",max);
	}
	return 0;
}

int count(int a,int b)      //比较是否构成contiguous balanced group
{
	int j;
	for(j=0;j<k;j++){
		if(c[a][j]!=c[b][j])return -1;
	}
	return b-a;
}




bzoj1637 [Usaco2007 Mar]Balanced Lineup

Description Farmer John 决定给他的奶牛们照一张合影,他让 N (1 ≤ N ≤ 50,000) 头奶牛站成一条直线,每头牛都有它的坐标(范围: 0..1,000,000,...
  • zhb1997
  • zhb1997
  • 2014年07月29日 23:20
  • 340

[BZOJ1637][Usaco2007 Mar]Balanced Lineup

传送门http://www.lydsy.com/JudgeOnline/problem.php?id=1637题目大意给n个位置上有两种物品,选出两种物品数相同的最大区间长度题解非常神奇的前缀和ORZ...
  • slongle_amazing
  • slongle_amazing
  • 2015年09月10日 20:44
  • 566

bzoj 1702: [Usaco2007 Mar]Gold Balanced Lineup 平衡的队列

Description Farmer John's N cows (1
  • lqybzx
  • lqybzx
  • 2014年11月01日 14:37
  • 1305

H - River Hopscotch解题报告(张浩盛伦)

H - River Hopscotch Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...
  • CSUST_ACM
  • CSUST_ACM
  • 2012年03月21日 14:01
  • 1155

HDU-1728 逃离迷宫 解题报告(张浩盛伦)

Description   给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障...
  • CSUST_ACM
  • CSUST_ACM
  • 2012年02月29日 12:24
  • 1667

POJ_3274 Gold Balanced Lineup 解题报告

Gold Balanced Lineup Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 80...
  • May_heyikai
  • May_heyikai
  • 2012年03月29日 19:05
  • 358

POJ-3274 Gold Balanced Lineup 解题报告

Description Farmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has been ...
  • angle555945
  • angle555945
  • 2012年03月16日 01:02
  • 700

Balanced Lineup (基本线段树)

点击打开链接 1、题目大意: 有N头牛,给定N头牛的高度,输出给定区间内最高牛的高度与最低牛的高度差   输入:第一行两个数N、Q分别代表N头牛,Q个操作区间 接下来输入N个数,代表N头牛的...
  • sdjzping
  • sdjzping
  • 2013年01月29日 21:13
  • 733

POJ 3264 Balanced Lineup (ST算法入门)

转载请注明出处,谢谢http://blog.csdn.net/acm_cxlove/article/details/7854526       by---cxlove 题目:查询区间的最大值和最...
  • ACM_cxlove
  • ACM_cxlove
  • 2012年09月03日 18:31
  • 1730

JZOJ2935. 【USACO Open 2012 Gold Division】Balanced Cow Subsets

题目大意 给n个数,从中任意选出一些数,是这些数能分成和相等的两组。 求有多少种选数的方案。 Data Constraint n≤20...
  • Akak__ii
  • Akak__ii
  • 2016年05月24日 22:47
  • 667
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:B - Gold Balanced Lineup解题报告(张浩盛伦)
举报原因:
原因补充:

(最多只允许输入30个字)