2013-2014 Petrozavodsk Winter Training Camp Saratov SU Contest
Revision as of 11:35, 17 April 2019 by Xiejiadong (talk | contribs) (Created page with "== Problem A == Unsolved. == Problem B == Unsolved. == Problem C == Solved by Weaver_zhu. 01:59 (+) == Problem D == Unsolved. == Problem E == Solved by Xiejiadong. 00...")
Problem A
Unsolved.
Problem B
Unsolved.
Problem C
Solved by Weaver_zhu. 01:59 (+)
Problem D
Unsolved.
Problem E
Solved by Xiejiadong. 00:54 (+2)
题意：两个字符串可以匹配成一队，他们的价值是他们的公共前缀，求最大价值。
题解：把所有的字符串丢进 Trie ，如果当前结点的单词结尾数量大于 $1$ ，那么就两两匹配，他们的价值就是当前结点的深度。
如果匹配完以后还有剩下的，丢给父亲。
两发罚时是因为煞笔 queue 导致了我 MLE 。
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Solved by Kilo_5723. 04:53 (+3)
Problem K
Unsolved.