so yknow i was on the dp grind when someone posted this problem on the github issues for the usaco guide (you can test here, but prepare google translate)
so we have a buncha circles, intervals really
and we wanna remove some so that none of them intersect (they can be tangent tho)
so let's define min_remove[s][e]
as the minimum amount of circles we have to
remove given that the only circles we consider are the ones that are completely