小张研发了一个软件,用来统计看章回体小说时,对书中人物同时出现的情况进行简单分析。
def getMaxLen(result): mlen=0 for item in result: t=item[1]-item[0]+1 if t>_______: mlen=t return mlen def allIn(total,cno): for item in names: if ____________: return False return True def calculate(total,n): num,length=0,0 result=[] k=-1 for i in range(0,n): if allIn(total,i): _________ if length==0: begin=i+1 result.append([begin,begin]) k+=1 length+=1 result[k][1]=i+1 else: length=0 return num,result n,m=map(int,input().split()) names=input().split(',') total={} for i in range(m): a=[int(t) for t in input().split()] total[names[i]]=a num,result=calculate(total,n) mlen=getMaxLen(result) print(num) print(result) print(mlen)