[理工] 最小負環屬於p嗎？怎麼求?
想請問第六題的b
直覺想是所有邊權重乘-1
然後求最大正環
可是感覺跟最長路一樣是npc耶
我是不是誤解了什麼
想請問這個n三方logn的算法？
感謝
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 114.137.241.144
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1486371341.A.107.html
→
02/06 17:47, , 1F
02/06 17:47, 1F
→
02/06 17:48, , 2F
02/06 17:48, 2F
推
02/06 17:50, , 3F
02/06 17:50, 3F
→
02/06 17:50, , 4F
02/06 17:50, 4F
→
02/06 17:53, , 5F
02/06 17:53, 5F
→
02/06 17:55, , 6F
02/06 17:55, 6F
→
02/06 17:55, , 7F
02/06 17:55, 7F
→
02/06 17:56, , 8F
02/06 17:56, 8F
→
02/06 18:10, , 9F
02/06 18:10, 9F
推
02/06 20:08, , 10F
02/06 20:08, 10F
→
02/06 20:08, , 11F
02/06 20:08, 11F