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

题目链接

参考代码：

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

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

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