题目链接:
解题思路:
找到和最大的长度为ceil(N/2)的连续子序列即可
T=int(input())
for tt in range(T):
N=int(input())
wall=input()
if N%2==0:
n=int(N/2)
else:
n=int(N//2+1)
max_val=0
stack=[]
for i in wall:
stack.append(int(i))
pre_sum=[0]
for i in range(N):
pre_sum.append(pre_sum[-1]+stack[i])
for i in range(N-n+1):
ans=pre_sum[i+n]-pre_sum[i]
if ans>max_val:
max_val=ans
print("Case #{}: {}".format(tt+1, max_val))