摘要: In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in 阅读全文
posted @ 2019-02-19 07:13 Review->Improve 阅读(1480) 评论(0) 推荐(0) 编辑