当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2146：The most binary substring

题目描述
Everybody knows the number is saved with the binary string in the computer. Now, their have N (1 <= N <= 1000) binary strings I tell you, your task is tell me what is the most binary substring with K (1 <= K <= L) characters in the strings I give you. The length of each string is L (1 <= L <= 60). Output times of the most appearing binary substring.
输入解释
Each line will contain three numbers N, L, K.
Following N lines, represent N binary strings.
输出解释
One answer one line.
输入样例 
2 6 3
101011
110101
2 6 4
101011
110101
输出样例 
4
2
提示
In first case, the most sequence is 101, it appears 4 times.
In second case, the most sequence is 1010 or 0101, they all just appear 2 times.
来自杭电HDUOJ的附加信息
Author 威士忌
Recommend 威士忌
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 HDU 2007-11 Programming Contest
源链接： HDU-2146
最后修改于 2020-10-25T22:50:53+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
5000/1000MS(Java/Others) 30000/10000K(Java/Others)