【CodeForces】Codeforces Round 857 (Div. 2) B

#include<iostream>
using namespace std;
#define ll long long
const int N=10010;
int a[N];
int main()
{
  int t;
  cin>>t;
  while(t--)
  {
    ll n;
    ll ans = 0, pigs = 0, cages = 0;
      cin >> n;
      for(int i=0;i<n;i++)
    {
      cin>>a[i];
      if (a[i] == 1)
          {
              pigs++;
              cages++;
          }
          else
          {
              if (pigs != 0)//关键点
              {
                  cages = pigs / 2 + 1;
              }
          }
              ans = max(ans, cages);
    }     
      cout << ans << endl;
  }
}