POJ---3274-Gold Balanced Lineup(hash)
来源:互联网 发布:php开发框架 编辑:程序博客网 时间:2024/05/29 09:50
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 theK 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
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
Sample Input
7 37672142
Sample Output
4
Hint
Source
#include <iostream>#include <cmath>#include <algorithm>#include <cstdio>#include <cstring>#include <vector>using namespace std;const int size=100001;const int mod=99991;int sum[size][30];int map[size][30];int n,m;int MaxLen;vector<int> hash[mod];bool cmp(int ai,int bi){ for(int j=0; j<m; j++) if(map[ai][j]!=map[bi][j]) return false; return true;}void Hash(int x){ int i,j; int key=0; for(j=1; j<m; j++) key+=map[x][j]*j; key=abs(key)%mod; for(i=0; i<hash[key].size(); ++i) { if(cmp(hash[key][i],x)) { if(MaxLen<x-hash[key][i]) MaxLen=x-hash[key][i]; return; } } hash[key].push_back(x); return;}int main(){ int i,j,x,num01; while(scanf("%d%d",&n,&m)!=EOF) { for(i=0; i<m; i++) { map[0][i]=0; sum[0][i]=0; } hash[0].push_back(0); MaxLen=0; for(i=1; i<=n; i++) { scanf("%d",&x); for(j=0; j<m; j++) { num01=x%2; x/=2; sum[i][j]=sum[i-1][j]+num01; map[i][j]=sum[i][j]-sum[i][0]; } Hash(i); } printf("%d\n",MaxLen); } return 0;}
- POJ 3274 Gold Balanced Lineup (hash)
- POJ 3274 Gold Balanced Lineup (hash)
- POJ---3274-Gold Balanced Lineup(hash)
- POJ 3274 Gold Balanced Lineup(HASH)
- POJ 3274 GOLD BALANCED LINEUP(HASH)
- POJ Gold Balanced Lineup(3274)-神Hash
- POJ 3274 - Gold Balanced Lineup(Hash)
- poj 3274 Gold Balanced Lineup(hash)
- poj 3274 Gold Balanced Lineup Hash
- POJ 3274 Gold Balanced Lineup hash
- POJ 3274 Gold Balanced Lineup 数组Hash
- 【POJ】3274 Gold Balanced Lineup 哈希hash
- POJ-3274(hash结构)(Gold Balanced Lineup )
- POJ---3274[Gold Balanced Lineup] 数组的hash
- poj 3274 Gold Balanced Lineup, 链地址hash
- POJ 3274 Gold Balanced Lineup
- POJ 3274 Gold Balanced Lineup
- POJ 3274 Gold Balanced Lineup
- tableDnD实现table里行的拖拽排序
- mySql与oracle分页技术原理与实现
- eclipse连接真机无log,显示log device is empty!的解决办法
- scala学习笔记--基础
- SharePoint 2013 在母版页中插入WebPart
- POJ---3274-Gold Balanced Lineup(hash)
- java Jackson 库操作 json 的基本演示
- Python的列表推导式学习
- 关于Android NDK中调用第三方的动态库
- cxf自定义返回错误信息
- [php] ThinkPHP缓存技术(S(),F(),查询缓存,静态缓存)
- 欢迎使用CSDN-markdown编辑器
- 面向接口编程详解(三)——模式研究
- 模板特化