flip bit problem | Python Fiddle

original_array = [1,0,0,1,1,0,0,0,0,1,1,1,0,1,1,0,1]
n = len(original_array)
new_array = [0] * n
original_1 = 0
for i in xrange(n):
    if original_array[i] == 1:
        new_array[i] = -1
        original_1 = original_1 + 1
    else:
        new_array[i] = 1;

def find_max_sum(array):
   print 'array = %s' % array
   best_left = None
   best_right = None
   best_sum = 0
   current_left = 0
   current_sum = 0
   for i in xrange(len(array)):
       current_sum = current_sum + array[i]
       if current_sum > best_sum:
           best_sum = current_sum
           best_left = current_left
           best_right = i
           print 'update best_sum = %s' % best_sum
       if current_sum < 0:
           current_left = i+1
           current_right = i+1
           current_sum = 0
           print 'reset current_sum to %s' % current_sum
       else:
           current_right = i
           print 'update current_right to %s' % i
   return best_sum

max_diff = find_max_sum(new_array)

if original_1 == n:
   ans = n - 1
else:
   ans = original_1 + max_diff
    
print ans

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE