这道题目要求找出两个不同塔形中能构成最高相同形状和大小双塔的瓷砖数量，即找到两塔的最长公共子序列。输入包含多个数据块，每个数据块描述了一对塔，给出每座塔的瓷砖半径。输出为最高双塔的瓷砖数量。
The Twin Towers
Input: standard input
Output: standard output
Once upon a time, in an ancient Empire, there were two towers of dissimilar shapes in two different cities. The towers were built by putting circular tiles one upon another. Each of the tiles was of the same height and had integral radius. It is no wonder that though the two towers were of dissimilar shape, they had many tiles in common.
最低0.47元/天 解锁文章
698
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
