class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int n=nums.size();
        int sum=0;
        vector<int> arr;
        for(int i=0;i<nums.size();i++)
        {
            if(nums[i]==1)
            {
                sum++;
            }
            else
            {
                arr.push_back(sum);
                sum=0;
                    
            }
            
        }
        return *max_element(arr.begin(), arr.end());
        
    }
        
};