伏地膜__shi%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
题意：一段1中有两段0= =（比如这个100111000011111）
以及n个操作：将[li,ri]上的数取反，代价为ri-li+1
求数列全变为1的最小代价。
考场上写了个25的爆搜。顺便%%%ZHL大爷160Rank1
Flandre Scarlet's Blog
Saishoukichiku Coding
Host by is-Programmer.com | Power by Chito 1.3.3 beta | Theme: Aeros 2.0 by TheBuckmaker.com