def find_last_occurrence(A, x):
    if not A:
        return -1
    
    low, high = 0, len(A) - 1
    result = -1
    
    while low <= high:
        mid = (low + high) // 2
        if A[mid] == x:
            result = mid
            low = mid + 1
        elif A[mid] < x:
            low = mid + 1
        else:
            high = mid - 1
    
    return result