maxusers.py

def maxusers(locations, weights, m):
    n = len(locations) - 1
    P = [0] * (n+1)
    prev = [0] * (n+1)

    P[0] = 0

    i = 1
    j = 2
    while(j <= n):
        if locations[j] - locations[i] >= m:
            prev[j] = i
            if i + 1 < j:
                i += 1
                continue
        j += 1

    for i in range(n+1):
        P[i] = max(weights[i] + P[prev[i]], P[i-1])

    return P[n]


print(maxusers([-1, 0, 3, 4, 8, 9, 10, 14], [-1, 10, 15, 8, 5, 60, 45, 10], 4))