After the big birthday party, Katie still wanted Shiro to have some more fun. Later, she came up with a game called treasure hunt. Of course, she invited her best friends Kuro and Shiro to play with her.
The three friends are very smart so they passed all the challenges very quickly and finally reached the destination. But the treasure can only belong to one cat so they started to think of something which can determine who is worthy of the treasure. Instantly, Kuro came up with some ribbons.
A random colorful ribbon is given to each of the cats. Each color of the ribbon can be represented as an uppercase or lowercase Latin letter. Let's call a consecutive subsequence of colors that appears in the ribbon a subribbon. The beauty of a ribbon is defined as the maximum number of times one of its subribbon appears in the ribbon. The more the subribbon appears, the more beautiful is the ribbon. For example, the ribbon aaaaaaa has the beauty of 77 because its subribbon a appears 77 times, and the ribbon abcdabc has the beauty of 22 because its subribbon abc appears twice.
The rules are simple. The game will have nn turns. Every turn, each of the cats must change strictly one color (at one position) in his/her ribbon to an arbitrary color which is different from the unchanged one. For example, a ribbon aaab can be changed into acab in one turn. The one having the most beautiful ribbon after nn turns wins the treasure.
Could you find out who is going to be the winner if they all play optimally?
The first line contains an integer nn (0≤n≤1090≤n≤109) — the number of turns.
Next 3 lines contain 3 ribbons of Kuro, Shiro and Katie one per line, respectively. Each ribbon is a string which contains no more than 105105 uppercase and lowercase Latin letters and is not empty. It is guaranteed that the length of all ribbons are equal for the purpose of fairness. Note that uppercase and lowercase letters are considered different colors.
Print the name of the winner ("Kuro", "Shiro" or "Katie"). If there are at least two cats that share the maximum beauty, print "Draw".
3
Kuroo
Shiro
Katie
Kuro
7
treasurehunt
threefriends
hiCodeforces
Shiro
1
abcabc
cbabac
ababca
Katie
15
foPaErcvJ
mZaxowpbt
mkuOlaHRE
Draw
In the first example, after 33 turns, Kuro can change his ribbon into ooooo, which has the beauty of 55, while reaching such beauty for Shiro and Katie is impossible (both Shiro and Katie can reach the beauty of at most 44, for example by changing Shiro's ribbon into SSiSS and changing Katie's ribbon into Kaaaa). Therefore, the winner is Kuro.
In the fourth example, since the length of each of the string is 99 and the number of turn is 1515, everyone can change their ribbons in some way to reach the maximal beauty of 99 by changing their strings into zzzzzzzzz after 9 turns, and repeatedly change their strings into azzzzzzzz and then into zzzzzzzzz thrice. Therefore, the game ends in a draw.
题意：给你一个n和三个字符串，表示操作n次（必须操作），每次必须修改一个字符，问最后三个字符串中，重复次数最多的是哪个。
思路：首先我们遍历一遍，求出每个字符串中单个字符出现次数最多的一个（由贪心知一个子字符串出现几次，那么里面的元素也会出现那么多次，要想让它重复次数最多，肯定是一个字符重复次数越多越好）。如果len=1的话，那么三者肯定会一样；如果重复的最多次数等于len，那么就判断n，如果n等于1，那么当前字符最大次数为len-1,否则和最大次数不等于len一样为min(len,mx+n）
代码实现如下：
#include <bits/stdc++.h>
using namespace std; int n;
string s[];
int num[][], mx[]; int main() {
ios::sync_with_stdio(false);
cin.tie();
cin >>n;
int len;
memset(num, , sizeof(num));
for(int i = ; i < ; i++) {
cin >>s[i];
len = s[i].size();
for(int v : s[i]) {
num[i][v]++;
}
mx[i] = *max_element(num[i], num[i] + );
if(mx[i] == len) {
if(n == ) {
mx[i] = len - ;
} else {
mx[i] = min(len, mx[i] + n);
}
}
else {
mx[i] = min(len, mx[i] + n);
}
}
if(len == ) cout <<"Draw" <<endl;
else if(count(mx, mx + , *max_element(mx, mx + )) > ) cout <<"Draw" <<endl;
else {
if(mx[] > max(mx[], mx[])) cout <<"Kuro" <<endl;
else if(mx[] > max(mx[], mx[])) cout <<"Shiro" <<endl;
else cout <<"Katie" <<endl;
}
return ;
}