最长等比子序列

def MaxLen(str):
    length=len(str)
    if length==2:
        return 2
    if length==3:
        return 2+int(str[1]/str[0]==str[2]/str[1])
    longest=[[2 for i in range(length)]]*length
    print(longest)
    for j in range(length):
        for i in range(j):
            for m in range(i):
            #print(str[j]>str[i])
             if(str[j]/str[i]==str[i]/str[m] and longest[j][i]<longest[i][m]+1):
                 #print(m,str[m],' ',i,str[i],' ',j,str[j])
                 longest[j][i]=longest[i][m]+1
                 m = i

    max=0
    for i in range(length):
        for j in range(length):
            if longest[i][j]>max:
                 max=longest[i][j]
    return max
str=[2,4,8,16,32,70]
MaxLen(str)