title: Could not understand "painter partition "
body: <p>I have gone through the painters partition problem (<a href="http://articles.leetcode.com/2011/04/the-painters-partition-problem-part-ii.html" rel="nofollow">http://articles.leetcode.com/2011/04/the-painters-partition-problem-part-ii.html</a>) . but could not get it. could any one please describe it. particularly i am not able to understand "Find the <code>index j</code> such that <code>B[j]</code> fails to satisfy the condition while <code>B[j+1]</code> satisfy"</p>