02 2019 档案

【折半枚举】 String Coloring
摘要：Problem Statement You are given a string SS of length 2N2N consisting of lowercase English letters. There are 22N22N ways to color each character in S 阅读全文
posted @ 2019-02-14 10:31 听风不成泣 阅读(221) 评论(0) 推荐(0)