LucienShui

链接:  http://acm.hdu.edu.cn/showproblem.php?pid=1238题目：Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its

链接:  http://acm.hdu.edu.cn/showproblem.php?pid=1358题目：Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want