这是一篇关于解决Codeforces编程挑战的文章，题目要求找出历史上可以形成的最长的王朝名称。根据Berland的传统，国王的名字由其前任名字的首字母和自己名字的首字母组成，以此形成连续的王朝名称。给定一系列国王的姓名缩写，任务是确定可能存在的最长王朝名称的长度。文章提供了题意解析、解题思路以及AC代码。
A. Dynasty Puzzles
time limit per test：2 seconds
memory limit per test：256 megabytes
input：standard input
output：standard output
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of their kings. They called every king by the first letters of its name. Thus, the king, whose name was Victorious Vasily Pupkin, was always called by the berlanders VVP.
In Berland over its long history many dynasties of kings replaced each other, but they were all united by common traditions. Thus, accord
最低0.47元/天 解锁文章
592
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
