摘要:题目链接: Fluorescent Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Problem Description Matt, a famous adventurer who
阅读全文
摘要:题目链接: Heap Partition A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every node is labelled
阅读全文