Length of the largest subarray with contiguous elements

def findLength(arr, n):
    maxLen = 1
    i = 0
    while i < n - 1:
        minn = arr[i]
        maxx = arr[i]
        j = i + 1
        while j < n:
            minn = min(minn, arr[j])
            maxx = max(maxx, arr[j])
            if maxx - minn == j - i:
                maxLen = max(maxLen, maxx - minn + 1)
            j = j + 1
        i = i + 1
    return maxLen


n = int(input("Number of elements: "))
arr = list(map(int, input().split(' ')))[:n]

print("Length of the longest contiguous subarray is %s" % findLength(arr, n))