Length of the longest subarray with positive product

//{ Driver Code Starts
//Initial Template for C++



#include <bits/stdc++.h>
using namespace std;


// } Driver Code Ends
//User function Template for C++

class Solution {
    public:
        // Function to return the length of the
        //longest subarray with ppositive product
         int maxLength(vector<int> &arr,int n){

           int maxlen=0,cnt_neg=0,strt=0,end=0;

           int neg_pos=-1;

           for(end;end<n;end++){

               if(arr[end]==0){

                   strt=end+1;

                   cnt_neg=0;

                   neg_pos=-1;

               }

               else if(arr[end]>0){

                   if(cnt_neg&1 ){

                       maxlen=max(maxlen,end-neg_pos);

                   }

                   else 

                   {

                       maxlen=max(maxlen,end-strt+1);

                   }

               }

               else{

                   cnt_neg++;

                   if(cnt_neg==1)

                    neg_pos=end;

                   if(cnt_neg%2==0){

                       maxlen=max(maxlen,end-strt+1);

                   }

               }

           }

         return maxlen;  

        }
};

//{ Driver Code Starts.

int main() {
	int t;
	cin>>t;
	while(t--){
	    int n;
	    cin>>n;
	    vector<int> arr(n);
	    for(int i = 0;i<n;i++){
	        cin>>arr[i];
	    }
	    Solution ob;
	    int res = ob.maxLength(arr,n);
	    cout<<res<<"\n";
	}
	return 0;
}
// } Driver Code Ends