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;
}




相关文章推荐

POJ_3274 Gold Balanced Lineup 解题报告

Gold Balanced Lineup Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 80...

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

H - River Hopscotch Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...

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

Description   给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障...

线段树:Balanced Lineup(pku 3264)(解题报告)

Balanced Lineup            Time Limit: 5000MS    Memory Limit: 65536K  Total Submissions: 1166...

线段树 ST算法 RMQ poj 3264 Balanced Lineup 解题报告

线段树 ST算法 RMQ poj 3264 Balanced Lineup 解题报告

POJ - 3264 Balanced Lineup解题报告(RMQ问题 ST算法 魔板题)

题目大意: 给你一串数,50,000个,询问200,000个区间,每次询问输出该区间最大值与最小值的差 分析: 这个因为不用修改,只需要查询,其实用树状数组也是可以的我觉得,但是因为还是有一...

POJ3274-Gold Balanced Lineup

  • 2011年07月31日 00:07
  • 90KB
  • 下载

【LeetCode】Balanced Binary Tree 解题报告

【题目】 Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bi...
  • ljiabin
  • ljiabin
  • 2014年10月12日 20:15
  • 5639

POJ---3274[Gold Balanced Lineup] 数组的hash

hash函数抄网上的,自己写的死活没过:  /*数组的hash*///思路://(1):sum[i][j]表示前i头牛第j个特征的总和//(2):sum[b][j]-sum[a-1][j];表示[a,...

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

Description Farmer John's N cows (1
  • lqybzx
  • lqybzx
  • 2014年11月01日 14:37
  • 1239
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:B - Gold Balanced Lineup解题报告(张浩盛伦)
举报原因:
原因补充:

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