shunfurh
编程介的小学生
采纳率92.7%
2019-02-19 10:41 阅读 187

最大二进制公共子序列的一个算法的问题如何利用C语言的办法去实现怎么做?

Problem Description
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.

Input
Each line will contain three numbers N, L, K.
Following N lines, represent N binary strings.

Output
One answer one line.

Sample Input
2 6 3
101011
110101
2 6 4
101011
110101

Sample Output
4
2

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 复制链接分享

相关推荐