Code snippet for 1's and 0's

snip2.cpp

int diff = 0;

for (int i = 0; i <= n; i++){
   if (B[diff + n] == -1) B[diff + n] = i; 
   else B[diff+ n] = min(B[diff + n], i);
   
   if (C[diff + n] == -1) C[diff + n] = i; 
   else C[diff + n] = max(C[diff + n], i);
   
   if (i < n && A[i] == 0) diff--; 
   else diff++;     
}