POJ 3274:Gold Balanced Lineup 做了两个小时的哈希
2015-10-27 22:37
471 查看
Gold Balanced Lineup
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
Sample Output
Hint
In the range from cow #3 to cow #6 (of size 4), each feature appears in exactly 2 cows in this range
这个题的题意好无厘头。。。
对于一个特征来说,每头牛有这个特征是为1,没有这个特征是为0。然后把每头牛的01串变成一个十进制的数。问找到一个最长的区间,满足这个区间内每一个特征含有的总数是相等的。
这个时候发现最大区间问题其中的一个思路就是哈希啊,之前求51nod
1393:0和1相等串这个也是哈希。
然后这道题就是考虑各种情况吧,自己一头牛也可能是最大的区间。
代码:
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 13540 | Accepted: 3941 |
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
这个题的题意好无厘头。。。
对于一个特征来说,每头牛有这个特征是为1,没有这个特征是为0。然后把每头牛的01串变成一个十进制的数。问找到一个最长的区间,满足这个区间内每一个特征含有的总数是相等的。
这个时候发现最大区间问题其中的一个思路就是哈希啊,之前求51nod
1393:0和1相等串这个也是哈希。
然后这道题就是考虑各种情况吧,自己一头牛也可能是最大的区间。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #pragma warning(disable:4996) using namespace std; int n, k; int value[100005]; int val[100005][31]; int searc[100005];//看是否有冲突 vector<int>dic[100005]; int check(int i, int key) { int j, h, answer = 0; for (j = 0; j < dic[searc[key]].size(); j++) { for (h = 2; h <= k; h++) { if ((val[dic[searc[key]][j]][h] - val[i][h]) != (val[dic[searc[key]][j]][h - 1] - val[i][h - 1])) break; } if (h == k + 1) { if (i - dic[searc[key]][j] > answer) { answer = i - dic[searc[key]][j]; } } } if (answer == 0) { dic[searc[key]].push_back(i); } return answer; } int main() { //freopen("i.txt", "r", stdin); //freopen("o.txt", "w", stdout); int i, ans, fea, key, dic_num, temp, temp2; scanf("%d%d", &n, &k); ans = 0; dic_num = 0; memset(searc,0,sizeof(searc)); for (i = 0; i < 31; i++) { val[0][i] = 0; } for (i = 1; i <= n; i++) { scanf("%d", &value[i]); key = 0; fea = 1; temp2 = value[i]; while (fea <= k) { val[i][fea] = (temp2 & 1) + val[i - 1][fea]; if (fea != 1) key += abs(val[i][fea] - val[i][fea - 1]); fea++; temp2 = temp2 >> 1; } if (value[i] == 0 || value[i] == pow(2.0, k) - 1) { ans = max(ans, 1); } if (key == 0) { ans = max(ans, i); } if (searc[key] == 0) { searc[key] = ++dic_num; dic[dic_num].push_back(i); } else { temp = check(i, key); if (temp > ans) { ans = temp; } } } cout << ans << endl; return 0; }
相关文章推荐
- POJ 3274:Gold Balanced Lineup 做了两个小时的哈希
- 南阳CCPC G题 Ancient Go
- beggo 模板函数
- Google play内购 Iab
- 深入解析Go语言的io.ioutil标准库使用
- DVFS Governor Interactive-choose_freq()函数解析
- Go语言的os包中常用函数初步归纳
- hihoCoder #1198 Memory Allocating Algorithm
- 2015 南阳 CCPC G.Ancient Go
- django cookies 和 session
- 在Go语言程序中使用gojson来解析JSON格式文件
- 038.category 分类/类别
- 039.category 对类进行模块化设计
- 040.category 调用私有方法
- 求最长回文子串的Manacher算法,time O(n)
- GO语言的IO方法实例小结
- windows下用eclipse+goclipse插件+gdb搭建go语言开发调试环境
- Go语言编程中对文件读写的基本方法整理
- 036.Goto 代替 Break 结束循环
- 制作自己的开发板logo