xt 1143 K叉赫夫曼树

最新推荐文章于 2024-07-24 10:05:18 发布

狮子和猿

最新推荐文章于 2024-07-24 10:05:18 发布

阅读量735

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/cscj2010/article/details/7586740

Data Struct、Algorithm and ACM 专栏收录该内容

281 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

该博客讨论了一种数据编码方法，其中给定字符串S需要使用字符集C进行编码，要求编码后的字符串T中每个原始字符的编码都不同且其所有非空前缀也不同。目的是找到使T最短的编码方式。输入包含字符串S和字符集C，输出为T的最小可能长度。示例输入和输出展示了具体操作。

Data Encoding

Given a string S, your job is to encode it into a new string T using given charset C. To make the decoding easy, each original character X in S is encoded into a string Y made up of characters in C. What's more, for two different X₁ and X₂, Y₁ must be different from Y₂ and all its non-empty prefixes. What's the minimum possible length of T?

Input

There are multiple test cases. Each test case contains two lines, S and C. The length of S will be at most 100000. The length of C will be at least 2 and all characters in C will be different.

了解本专栏