问题标题: 酷町堂：5673 CF688A Opponents

题目链接： 酷町堂：5673

题目描述 Description

Arya has nn opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya’s opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.

输入描述 Input Description

The first line of the input contains two integers nn and dd ( 1<=n,d<=1001<=n,d<=100 ) — the number of opponents and the number of days, respectively.
The ii -th of the following dd lines contains a string of length nn consisting of characters ‘0’ and ‘1’. The jj -th character of this string is ‘0’ if the jj -th opponent is going to be absent on the ii -th day.

输出描述 Output Description

Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.

样例输入 Sample Input

输入 #1 2 2 10 00 ########### 输入 #2 4 1 0100 ########### 输入 #3 4 5 1101 1111 0110 1011 1111

样例输出 Sample Output

输出 #1 2 ########### 输出 #2 1 ########### 输出 #3 2

RemoteJudge

您提交的代码将被发送回原 OJ 进行测评，并由酷町堂抓取其测评结果。 
将使用公用账户进行测评，建议您 绑定个人账户，使用自己在原 OJ 的账户提交测评。

题目描述

问题描述

小白有 n 个对手，他每天都要和这些对手PK。对于每一天，如果 n 个对手全部到齐，那么小白就输了一场，否则小白就赢了一场。特别的，如果某天一个对手都没有到，也算小白赢。现在已知对手 d 天的出场情况，请计算小白最多能连胜多少场。

输入输出格式

输入格式

第一行，两个整数 n , d ( 1 ≤ n,d ≤ 100 )。接下来 d 行，每行 n 个 0 或 1 的整数，依次表示这一天所有对手的到场情况， 1 表示到场， 0 表示缺席。

输出格式

一个整数，表示最多的连胜场次。

说明/提示

CodeForces 题目提交时的注意事项：

CodeForces 不允许多次提交同样的代码。如果您如此提交将会产生提交失败错误。如您确实需要这么做，请自行添加一些注释。