SDKD 2016 Summer Single Contest #01.F

Arya has n 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
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and the number of days, respectively.

The i-th of the following d lines contains a string of length n consisting of characters ‘0’ and ‘1’. The j-th character of this string is ‘0’ if the j-th opponent is going to be absent on the i-th day.

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

Sample Input
Input
2 2
10
00
Output
2
Input
4 1
0100
Output
1
Input
4 5
1101
1111
0110
1011
1111
Output
2
题目:
每一天,这个人就要去挑战对手,当这一天全为0即都不在或者不全为一时;
算他赢;当这一天全为一是算他输;求最大连续赢的天数.
题意题意~~~又看错题意,题意挺重要.~
读懂题就是个水题.

#include <iostream>
#include <algorithm>
using namespace std;
int n, d;

int main()
{
    cin >> n >> d;
    char a[101][10000];
    int nn[10000];
    for(int i = 0; i < 10000; i++)
        nn[i] = 1;
    for(int i = 0; i < d; i++)
    {
        for(int j = 0; j < n; j++)
        {
            cin >> a[i][j];
        }
    }
    int ans = 0;
    int cnt = 0;
    for(int i = 0; i < d; i++)
    {
        int j;
        for(j = 0; j < n; j++)
        {
            if(a[i][j] == '0')
                break;
        }
        if(j == n)
            cnt = 0;
        else
            cnt++;
        ans = max(ans, cnt);
    }
    cout << ans << endl;
    return 0;
}