枚举枚举:简单的来说就是枚举第一个1出现在哪个位子,其他位子的1就是在一个特定的区间,特定区间取min,然后用rmq维护查询.O(n2)O(n^2)解决.

code:

https://ac.nowcoder.com/acm/contest/view-submission?submissionId=49457505

还可以dp枚举:

https://ac.nowcoder.com/acm/contest/view-submission?submissionId=49460454