Chefstr2.py — различия между версиями
Материал из DISCOPAL
StasFomin (обсуждение | вклад) |
StasFomin (обсуждение | вклад) |
||
Строка 20: | Строка 20: | ||
lim = 3 * n / 4 | lim = 3 * n / 4 | ||
while ind <= lim: | while ind <= lim: | ||
− | |||
ks = -(n // -ind) | ks = -(n // -ind) | ||
− | for i in | + | |
− | + | frequency = [0] * lenalf*ind | |
− | + | max_frequency = [0]*ind | |
− | j = i | + | |
− | + | for i, idx in enumerate(input_idx): | |
− | + | j = i % ind | |
− | + | i_ = j*lenalf + idx | |
− | + | cur_req = frequency[i_] + 1 | |
− | + | if cur_req > max_frequency[j]: | |
− | + | max_frequency[j] = cur_req | |
− | + | frequency[i_] = cur_req | |
+ | |||
+ | cur_diff = ks*ind - sum(max_frequency) | ||
if cur_diff < operations: | if cur_diff < operations: |
Версия 23:18, 4 мая 2022
import sys def main(): symbols = {} alphabet = "abcdefghijklmnopqrstuvwxyz" lenalf = len(alphabet) for i in range(lenalf): symbols[alphabet[i]] = i input_str = sys.stdin.readline()[:-1] n = len(input_str) input_idx = bytearray([symbols[ch] for ch in input_str]) operations = 1e6 k_pow = 1e6 ind = 1 lim = 3 * n / 4 while ind <= lim: ks = -(n // -ind) frequency = [0] * lenalf*ind max_frequency = [0]*ind for i, idx in enumerate(input_idx): j = i % ind i_ = j*lenalf + idx cur_req = frequency[i_] + 1 if cur_req > max_frequency[j]: max_frequency[j] = cur_req frequency[i_] = cur_req cur_diff = ks*ind - sum(max_frequency) if cur_diff < operations: operations = cur_diff k_pow = ks elif operations == cur_diff: if ks < k_pow: k_pow = ks ind += 1 print(f"{operations} {k_pow}") main()