<每日一题> Day3：CodeForces-1141B.MaximalContinuousRest(简单题)

题目链接

参考代码：

#include <iostream>
#include <algorithm>
using namespace std;

const int maxn = 400000 + 5;
int value[maxn];
int n;

int main() {
    cin >> n;
    for(int i = 0; i < n; i ++) cin >> value[i];
    for(int i = 0; i < n; i ++) value[i + n] = value[i];
    int ans = 0, Max = 0;
    for(int i = 0; i < 2 * n; i ++) {
        if(value[i]) Max ++;
        else Max = 0;
        ans = max(ans, Max);
    }
    cout << ans << endl;
    return 0;
}