ZOJ 3963 Heap Partition set维护。给一个序列，将其划分成尽量少的序列，使每一个序列满足按照顺序构造二叉树，父母的值<=孩子的值。
摘要：
Heap Partition Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every n... 阅读全文
posted @ 2017-04-23 10:16 hnust_accqx 阅读(306) 评论(0) 推荐(0) 编辑
