Question

我试图解决USACO的项链断裂问题，然后遇到了这种解决方案。问题陈述在这里：https://train.usaco.org/usacoprob2?S=beads&a=c3sjno1crwH

我很困惑为什么编写此解决方案的人制作了3个初始字符串，基本上是整个for循环。

我尝试过在线寻找其他解决方案，可能会更好地解释它，但是针对此问题的Python解决方案很少，其中许多是完全不同的。

'''
ID: krishpa2
LANG: PYTHON3
TASK: beads
'''



with open('beads.in','r') as fin:
    N = int(fin.readline())
    beads = fin.readline()[:-1]

def canCollect(s):
    return not ('r' in s and 'b' in s)

beads = beads*3
max = 0

for p in range(N, N*2):
    i = p-1
    left = []
    while i > 0:
        if canCollect(left + [beads[i]]):
            left.append(beads[i])
            i -= 1
        else:
            break

    i = p
    right = []
    while i < 3*N - 1:
        if canCollect(right + [beads[i]]):
            right.append(beads[i])
            i+=1
        else:
            break

    result = len(left) + len(right)
    if result >= N:
        max = N
        break
    elif result > max:
        max = result
print(max)
with open('beads.out','w') as fout:
    fout.write(str(max) + '\n')

该程序正常运行，我只是想知道为什么。

Answer 1

我知道这个问题已经很老了，但是我仍然想为将来的人回答，所以我在下面做了一个完整评论的版本（基于joshjq91的this答案）-

"""
PROG: beads
LANG: PYTHON3
#FILE
"""

# Original file from Github by joshjq91 
# (https://github.com/jadeGeist/USACO/blob/master/1.2.4-beads.py)
# Comments by Ayush

with open('beads.in','r') as filein:
    N = int(filein.readline()) # Number of beads
    beads = filein.readline()[:-1] # Necklace

def canCollect(s):
    return not ('r' in s and 'b' in s) # If r and b are not in the same str,
                                       # then you can collect the string.
beads = beads*3 # Wraparound - r actually can be shown as r r r (wraparound 
                # for the front and back)
max = 0 # The final result

for p in range(N, N*2): # Loop through the 2nd bead string (so you can use
    i = p-1             # wraparounds for the front and back)
    left = []
    while i > 0: # Check if you can collect beads (left)
        if canCollect(left + [beads[i]]): # Can colleect
            left.append(beads[i]) # Add to left
            i -= 1 # Loop through again
        else:
            break # Cannot collect more beads - break

    i = p # You will otherwise have a duplicate bead (left is i=p-1)
    right = []
    while i < 3*N - 1:        # Check if you can collect beads (right) - i has
        #print("righti",i-N)  # to be less than 3*N - 1 b/c that is the length
        # ^ for testing       # of the beads + runarounds.

        if canCollect(right + [beads[i]]): # Can collect
            right.append(beads[i]) # Add to right
            i+=1 # Loop through again
        else:
            break # Cannot collect more beads - break

    result = len(left) + len(right) # Final result
    if result >= N: # The result was greater than N means that the whole
        max = N     # necklace is the same (EX: rwr)
        break # Break - we now know we don't need to go through again b/c the
              # whole string is the same! 
    elif result > max: # The result makes sense
        max = result

with open('beads.out','w') as fileout:
    fileout.write(str(max) + '\n') # Final result

需要帮助来了解USACO解决方案

1 个答案: