Codeforces Round #360 (Div. 2) A. Opponents

#include <iostream>
#include <cstring>
#include <string>
using namespace std;

const int maxn = 105;
int a[maxn], sum[maxn];

int main() {
    int n, d;
    string s;
    memset(a, 0, sizeof(a));
    memset(sum, 0, sizeof(sum));
    cin >> n >> d;
    for(int i = 0; i < d; i ++) {
        cin >> s;
        for(int j = 0; j < n; j ++) {
            if(s[j] == '0') {
                a[i] = 1;
                break;
            }
        }
    }
    int max = 0;
    int dp[maxn];
    if(a[0] == 0)
        dp[0] = 0;
    else
        dp[0] = 1;
    for(int i = 1; i < d; i ++) {
        if(a[i] == 0)
            dp[i] = 0;
        else
            dp[i] = dp[i - 1] + 1;
    }
    for(int i = 0; i < d; i ++) {
        if(dp[i] > max) {
            max = dp[i];
        }
    }
    cout << max << endl;
    return 0;
}