Submission #2698385

---

Source Code Expand

# def makelist(n, m):
#     return [[0 for i in range(m)] for j in range(n)]


s = input()
s = list(map(int, list(s)))

now = s[0]
cnt = 0
stack = []
for e in s:
    if now == e:
        cnt += 1
    else:
        stack.append(cnt)
        cnt = 1
        now = e
stack.append(cnt)

# print(stack)

l = len(stack)
ans = -1
if l == 1:
    ans = len(s)
elif l == 2:
    ans = max(stack)
elif l == 3:
    ans = min(stack[0]+stack[1], stack[1]+stack[2])
else:
    tmp1 = min(stack[0]+stack[1], stack[-2]+stack[-1])
    tmp2 = min(stack[2:l-2])
    ans = min(tmp1, tmp2)


print(ans)

Submission Info

Judge Result