Find zeroes to be flipped so that number of consecutive 1’s is maximized
<p>Find zeroes to be flipped so that number of consecutive 1’s is maximized.</p>

<pre><code>Input:   arr[] = {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1}
     m = 2
Output:  5 7
</code></pre>

<p>We are allowed to flip maximum 2 zeroes. If we flip
arr[5] and arr[7], we get 8 consecutive 1's which is
maximum possible under given constraints .</p>

<p>Now if we were to find just the maximum number of 1's that is possible, is it possible to solve using dynamic programming approach?</p>