作者查詢 / suhorng
作者 suhorng 在 PTT [ Prob_Solve ] 看板的留言(推文), 共337則
限定看板:Prob_Solve
看板排序:
全部C_Chat5350Math2497LightNovel1315C_and_CPP1218NTU423Prob_Solve337trans_math282Programming222CFantasy183NTUcourse143PLT110ck-talk103studyabroad76TOEFL_iBT75b00902HW71Grad-ProbAsk59SENIORHIGH57SMSlife48ASM44b00902xxx37Shana37GRE28NTU-Exam23Soft_Job22DoubleMajor21CSSE19Army-Sir15logic15juniorhigh14PangSir14CSCouncil13C_BOO11CKEISC10b98902xxx9Nangang8PHP8Python8b04902xxx7Gossiping7graduate6KanColle6Kyoto_Ani6b98902HW4b99902HW4b99902xxx4CS_TEACHER4CSIE_WSLAB4joke4KS98-3024LaTeX4love-vegetal4Militarylife4NTUHistory024Sub_CS4SYSOP4AC_In3b01902HW3b01902xxx3BBSmovie3CompilerDev3IdolMaster3NTUMG3Shokugeki3Suckcomic3Translate-CS3AfterPhD2Agr-Football2asciiart2b02902xxx2ck-inforOLD2ck60th1282CodeJob2H-GAME2Isayama2Libra2NTUMEB012NTUSA2specialman2StupidClown2SummerCourse2Ajax1ArakawaCow1ask1Aviation1B00305XXX1B00310XXX1b974060XX1b97902HW1Beauty1bi-sexual1Buddha1Buddhism1Bus1Capricornus1civil971ck58th3241ck61st1031ck61st3221ck61st3261ckbc1ComGame-Plan1CompBook1CSIE_Service1Daan1dog1DragonNest1Electronics1Evangelion1Fallinlove1FCU-EES1FinalFantasy1Gamesale1GetMarry1historia1home-sale1HSNU_11431IMO_Taiwan1Jeremy_Lin1JYPnation1KMSH_MS981KNU1Koei1KS97-3021KS97-3101LamiGirls1Linux1love1LoveLive_Sip1marriage1MCU_Talk1MH1Military1mobilesales1NCCU1NCHU-FT-1011NCHU_CsHsnu1NDHU-LF981NIHONGO1Nogizaka461NPTU1NTU_Service1ntuACCT031ntuACCT041NTUBA041NTUDMCC1NTUEE1151NTUfin061NTUMath1001NTUMEB001NTUmed001NTUSFA1NTUST_Talk1NTUT_EE496B1Pangya1part-time1PC_Shopping1PCSH96_3061piano1Pisces1pity1PuzzleDragon1Queer_drama1Railway1RakutenGirls1sex1sky1SRW1StarTrek1Stock1Suckgame1SuperBike1TakahashiRie1TOEIC1TokyoGhoul1Transfer1transgender1TTU-EE991TTU-I90B1TW-GHONOR1TWopera1uniform1Unlight1USC1VISA1Visual_Basic1Wen-Shan1Windows1WOW1WuYiFan1Yabuki1YZU_EE95B1Zhongzheng1<< 收起看板(192)
3F推:Chinese Postman Problem, 我記得當一個圖沒有 Euler-09/07 17:48
4F→:trial 時會需要用 weighted graph matching...09/07 17:48
6F→:請查 Chinese Postman problem (或T-join problem...)09/07 22:13
7F→:沒有Euler-circuit的話一定有很多(偶數個)奇點09/07 22:13
8F→:變成要多加邊 來造出 Euler-circuit09/07 22:14
9F→:弄一弄會發現求出那些奇點的 All-pair shortest path 後09/07 22:15
10F→:用一般圖帶權匹配可以解決09/07 22:15
1F推:BFS/DFS/用disjoint set計算08/07 22:20
2F→:你連通集的定義怪怪的...? 存在還是不存在?08/07 22:20
2F→:判斷算出來的面積是正的還是負的07/20 22:01
3F→:如果是凸多邊形,隨便抓三個連續點判斷就好07/20 22:01
6F推:對,所以還有一個問題是,每個點到底可不可以重複經過?06/19 19:39
7F→:但即使可重複經過也並不是就是MST06/19 19:40
1F推:維基上的圖片看來是C?06/02 21:07
3F→:不是演算法05/16 21:50
3F推:2也可以做成對每個可能的[a,b]都標 比如寫KMP一樣可以在線04/03 15:10
4F→:性時間內完成04/03 15:10
1F→:範例的意思是可以重複用嗎?04/03 13:45
3F→:codeforces...?03/12 08:25
1F推:2*p*f(k-1,n): 最左邊切一刀或最右邊切一刀, 用剩下的k-102/22 18:15
2F→:長木棍切出n長02/22 18:15
3F→:(1-p)^{k-1}: 這k-1個間隔都不切,剩下長度自然也≧n02/22 18:16
4F→:是說這遞迴式看起來好怪...真的是對的嗎 ?02/22 19:47