传送门 T1替换隐藏数字得到的最晚时间 思路 签到题，注意一些细节就行。 代码 T2满足三条件之一需改变的最少字符数 思路 枚举，对于三种要求，求出它们分别的步数，然后求三者最小值作为答案。 对于情况3，最简单，直接用i枚举26个字母，然后统计a串b串全部置为i所需要的步数就是情况3下的步数。 对于情况1与2，其实可以……
来自分类：做题
你已到达了世界的尽头(｡・`ω´･)！
-
edisoncgh
最近访客
评论
-
于「3年前」在「互换友链」中说:
-
于「3年前」在「互换友链」中说:( ,,´･ω･)ﾉ"(´っω･｀｡)
-
于「4年前」在「poj2524：Ubiquitous Religions」中说:Hello there! This is my 1st comment here so I just wanted to give a quick shout out and say I really enjoy reading through your articles. Can you suggest any other blogs/websites/forums that cover the same subjects? Thank you!
-
于「4年前」在「C++Trie树(字典树)」中说:I wish to point out my passion for your generosity giving support to people who require help with your situation. Your special commitment to passing the solution around appears to be pretty significant and have usually made people like me to get to their aims. The important facts signifies a whole lot a person like me and a whole lot more to my fellow workers. Many thanks; from everyone of us. Frannie Prentiss Langille
-
于「4年前」在「C++Trie树(字典树)」中说:Awesome post. I am a regular visitor of your blog and appreciate you taking the time to maintain the excellent site. I will be a frequent visitor for a long time. Manon Cornie Elwina
-
