Maximum weighted independent set in path graph

Sign in to test your solution.
def WISPath(path: list): """ >>> WISPath([1, 4, 5, 4, 2, 8, 1, 5, 2, 3, 4, 3, 10, 2]) [1,3,5,7,10,12] """ #TODO

  Python sandbox

This window allows you to run Python code without installing a thing. The code you write here is not automatically submitted to Dodona.

Test case being debugged