Help needed dp bit mask problem

Правка en1, от charan2628, 2022-03-09 09:02:52

This is the problem minimum-cost-to-connect-two-groups-of-points, please go through it. I'm stuck at this point: - At each level (going through each point 1..n in group 1) if I'm iterating different subgroups of group2 to connect, how to efficiently calculate the cost for the new connections excluding the connections already connected in previous level? - Or is there another way to do it?

Теги dp, bitmask

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский charan2628 2022-03-09 10:31:39 52 Tiny change: 's point:\n- At each le' -> 's point:\nAt each le'
en1 Английский charan2628 2022-03-09 09:02:52 530 Initial revision (published)