{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cp\u003eFarmer John\u0027s \u003ci\u003eN\u003c/i\u003e cows (1 ≤ \u003ci\u003eN\u003c/i\u003e ≤ 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 \u003ci\u003eK\u003c/i\u003e different features (1 ≤ \u003ci\u003eK\u003c/i\u003e ≤ 30). For example, cows exhibiting feature #1 might have spots, cows exhibiting feature #2 might prefer C to Pascal, and so on.\u003c/p\u003e\n \u003cp\u003eFJ 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 \u003d 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^(\u003ci\u003ei\u003c/i\u003e-1) place if a cow exhibits feature \u003ci\u003ei\u003c/i\u003e.\u003c/p\u003e\n \u003cp\u003eAlways the sensitive fellow, FJ lined up cows 1..\u003ci\u003eN\u003c/i\u003e 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 \u003ci\u003ei\u003c/i\u003e..\u003ci\u003ej\u003c/i\u003e is balanced if each of the \u003ci\u003eK\u003c/i\u003e 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.\u003c/p\u003e\n \u003c/div\u003e\nN(1\u003c\u003dN\u003c\u003d100000)头牛,一共K(1\u003c\u003dK\u003c\u003d30)种特色,\n每头牛有多种特色,用二进制01表示它的特色ID。比如特色ID为13(1101),\n则它有第1、3、4种特色。[i,j]段被称为balanced当且仅当K种特色在[i,j]内\n拥有次数相同。求最大的[i,j]段长度。"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Line 1: Two space-separated integers, \n \u003ci\u003eN\u003c/i\u003e and \n \u003ci\u003eK\u003c/i\u003e. \n \u003cbr\u003eLines 2..\n \u003ci\u003eN\u003c/i\u003e+1: Line \n \u003ci\u003ei\u003c/i\u003e+1 contains a single \n \u003ci\u003eK\u003c/i\u003e-bit integer specifying the features present in cow \n \u003ci\u003ei\u003c/i\u003e. 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 #\n \u003ci\u003eK\u003c/i\u003e.\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Line 1: A single integer giving the size of the largest contiguous balanced group of cows.\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e7 3\n7\n6\n7\n2\n1\n4\n2\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e4\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n In the range from cow #3 to cow #6 (of size 4), each feature appears in exactly 2 cows in this range\n \u003c/div\u003e"}}]}