Red Huang

Red Huang

HomeArchives

Hamilton Path

AOJ 1320 City Merger
有點麻煩的題目，算出 overlap，然後再計算有沒有子字串在裡面，子字串可以直接不用考慮 那麼把剩餘的點拿來做 Hamilton Path 最小成本即可 Copy /\* \* GCA : "Computer is artificial subject absolutely…
AOJ
Ownership of this blog data is guaranteed by blockchain and smart contracts to the creator alone.