제출 #716093

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716093		vjudge1	새로운 문제 (POI11_roz)	Cpython 3	30 / 100	1074 ms	5876 KiB

roz

n = int(input())
s = input()

alph = "abcdefghijklmnopqrstuvwxyz"

def m(s):
  max = 0
  min = 10**7
  for i in range(0, len(alph)):
    e=s.count(alph[i])
    if e == 0:
      continue
    if e>max:
      max = e
    if e<min:
      min = e
      
  return max-min
  
greatest = 0
for i in range(0, n):
  for j in range(i+1, n+1):
    
    r = m(s[i:j])
    if r>greatest:
      greatest = r

print(greatest)

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10