最大獨(dú)立集合狭归，最大團(tuán)問(wèn)題睛蛛，旅行商鹦马，決策樹胧谈，np完全問(wèn)題np完全問(wèn)題只能暴力搜（+剪枝）對(duì)于決策樹來(lái)說(shuō)，沒(méi)有暴力搜最優(yōu)解荸频，而是通過(guò)啟發(fā)式方法（信息...

怎么求多源點(diǎn)到多目的地的最短距離原理是菱肖，設(shè)計(jì)一個(gè)超級(jí)遠(yuǎn)點(diǎn)S，S和每個(gè)源點(diǎn)建立一條邊權(quán)為0的路徑旭从。（這個(gè)S是假想的稳强，實(shí)際實(shí)現(xiàn)的時(shí)候可不需建立）另一...

AcWing 125. 耍雜技的牛[acwing.com/activity/content/problem/content/3468/1/] 證...

AcWing 246. 區(qū)間最大公約數(shù)[https://www.acwing.com/activity/content/problem/cont...

AcWing 241. 樓蘭圖騰[https://www.acwing.com/activity/content/problem/content...

AcWing 1402. 星空之夜 [https://www.acwing.com/activity/content/problem/con...

AcWing 1069. 凸多邊形的劃分[https://www.acwing.com/activity/content/problem/con...