human
Maximize length of Subarray of 1 's after removal of a pair of consecutive Array elements | Python program to find the maximum count of 1 s.
If arr [ i - 2 ] = = 1 then we increment the count of occurences of 1 's.
Else we initialise the count with 0.
If arr [ i + 2 ] = = 1 then we increment the count of occurences of 1 's.
Else we initialise the count with 0.
We get the maximum count by skipping the current and the next element ..
Driver code"
How can the above be solved in Python?
assistant
#Here is code to maximize length of Subarray of 1 's after removal of a pair of consecutive Array elements and the other steps required.
 def maxLengthOf1s ( arr , n ) :
	prefix = [ 0 for i in range ( n ) ]
	for i in range ( 2 , n ) :
		if ( arr [ i - 2 ] == 1 ) :
			prefix [ i ] = prefix [ i - 1 ] + 1
		else :
			prefix [ i ] = 0
	suffix = [ 0 for i in range ( n ) ]
	for i in range ( n - 3 , - 1 , - 1 ) :
		if ( arr [ i + 2 ] == 1 ) :
			suffix [ i ] = suffix [ i + 1 ] + 1
		else :
			suffix [ i ] = 0
	ans = 0
	for i in range ( n - 1 ) :
		ans = max ( ans , prefix [ i + 1 ] + suffix [ i ] )
	print ( ans )
n = 6
arr = [ 1 , 1 , 1 , 0 , 1 , 1 ]
maxLengthOf1s ( arr , n )