Codeforces 888C： K-Dominant Character（水題）

You are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length at least k contains this character c.html You have to find minimum

>>阅读原文<<