青烟绕指柔的博客

题目链接：Codeforces - Deciphering我们其实可以看成是字母直接的匹配，然后求一个最大权值的匹配。怎么求对应的权值呢？显然我们只需要知道某个字母转化为另一个字母的价值，直接遍历一遍即可。最后还需要输出对应的匹配，就是link数组，注意link[i]是匹配 i 的点，而不是 i 匹配的link[i]，注意。AC代码：#pragma GCC optimize("-Of...

SpyOver time, those coaches in BDN Collegiate Progranuning Contest split into two camps.The big danger is that, while optimists and pessimists battle it out, the environment of this area becomes ever...