308964: CF1605C. Dominant Character
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Dominant Character
题意翻译
给定一个由 `abc` 组成的字符串,找出一个最短的子串,满足 `a` 的数量大于 `b` 的数量和 `c` 的数量,并且此子串的长度至少为 $2$。题目描述
Ashish has a string $ s $ of length $ n $ containing only characters 'a', 'b' and 'c'. He wants to find the length of the smallest substring, which satisfies the following conditions: - Length of the substring is at least $ 2 $ - 'a' occurs strictly more times in this substring than 'b' - 'a' occurs strictly more times in this substring than 'c' Ashish is busy planning his next Codeforces round. Help him solve the problem. A string $ a $ is a substring of a string $ b $ if $ a $ can be obtained from $ b $ by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.输入输出格式
输入格式
The first line contains a single integer $ t $ $ (1 \le t \le 10^{5}) $ — the number of test cases. The description of test cases follows. The first line of each test case contains a single integer $ n $ $ (2 \le n \le 10^{6}) $ — the length of the string $ s $ . The second line of each test case contains a string $ s $ consisting only of characters 'a', 'b' and 'c'. It is guaranteed that the sum of $ n $ over all test cases does not exceed $ 10^{6} $ .
输出格式
For each test case, output the length of the smallest substring which satisfies the given conditions or print $ -1 $ if there is no such substring.
输入输出样例
输入样例 #1
3
2
aa
5
cbabb
8
cacabccc
输出样例 #1
2
-1
3