2019年11月25日
TZOJ 4359: Partition the beans （二分）
摘要： 描述 Given an N x N square grid (2 <= N <= 15) and each grid has some beans in it. You want to write at most K (1 <= K <= 2N - 2) horizontal or vertical 阅读全文
posted @ 2019-11-25 14:10 zdragon 阅读(186) 评论(0) 推荐(0) 编辑