该博客讲述了如何利用位运算和高效算法设计中的Meet-in-the-Middle策略解决一个关于恐龙骨架重组的问题。在给定的输入条件下，需要找到能连接的最大数量的骨头，使得所有标记相同字母的关节相连。博主Liu介绍了通过递归的bitcount函数计算位1的数量，并通过枚举所有可能的状态，结合位运算来确定最佳解决方案。
Jurassic Remains
Paleontologists in Siberia have recently found a number of fragments of Jurassic period dinosaur skeleton. The paleontologists have decided to forward them to the paleontology museum. Unfortunately, the dinosaur was so huge, that there was no box that the fragments would fit into. Therefore it was decided to split the skeleton fragments into separate bones and forward them to the museum where they would be reassembled. To make reassembling easier, the joints where the bones were detached from each other were marked with special labels. Meanwhile, after packing the fragments, the new bones were found and it was decided to send them together with the main fragments. So the new bones were added to the package and it was sent to the museum.
However, when the package arrived to the museum some problems have shown up. First of all, not all labels marking the joints were distinct. That is, labels with letters `A' to `Z' were used, and each
最低0.47元/天 解锁文章
2981
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
