作者查詢 / yauhh
作者 yauhh 在 PTT [ Prob_Solve ] 看板的留言(推文), 共119則
限定看板：Prob_Solve
看板排序：
全部Soft_Job2172Master_D1344Tokusatsu1142JingXingBoys948C_and_CPP649Programming615logic386Lomo364Coffee298Visual_Basic231Cloud197PeopleSeries128Emergency124AndroidDev121Prob_Solve119Little-Games117photo102gallantry87CSSE78PLT78ComeHere77C_Sharp72book56CTV46Python44ShiauLiang42poem39Gossiping35L_TalkandCha35CodeJob28Ajax26L_LifeJob24magic_silver23Inference22Guolun20FJU-STAT95B19NCYU_BE_96b19NDHU-phy10119NIU-ECE94b19Isayama17LaTeX17soho15KingofPop12RealPlaying12TKU_EW94B12Linux10NTU-IPH9610NUK_AC9810share10Translate-CS10AfterPhD9NCKU-BEH959Christianity8FLAT_CLUB8NCCUflamenco8NCHU_CsHsnu8SYSOP8Viator98Bing8W-Philosophy8NUU-EE-97A7sky7SSSH-16th-Fk7GameDesign6JinYong6media-chaos6Ptt-Charity6TaiwanDrama6ai-photo5GossipPicket5HCHS933145KS93-3165XiangSheng5CYCU_Chem92b4CYCU_ICE90AB4Emulator4HSNU_11464Interdiscip4JP_Entertain4Militarylife4NCCU05_GIDS4NCCU_PFBASE4NCHU-Wind4NDHU-Ch994Notebook4NTPU-CSIE954NTUEE_Speech4NTUST-EE-B934PhD4PttLaw4Starbucks4Windows4Boy-Girl3Buddhism3FinalFantasy3Gamesale3Google3HarryPotter3Hate3HCSHch13_3113Keelung3KUAS_CSIE3NCCU3NCTU_CS_EDA3NDSH_6th3143NSwitch3NSYSU-Chem993OOAD3paranormal3PhotoCritic3Salary3Sijhih3SSSH-16th3093STREET_BALL3Tech_Job3TigerBlue3Violation3army_53-2T2B97A013XX2comm_and_RF2CS95WISDOM2Dragonica2Ecophilia2Education2EmailYang2FJU_JCS112Folklore2HHSH2HK-movie2java2Jeans2KOTDFansClub2KS98-3022MCU_Talk2Men5432MUSTMIS2NARUTO2NCHU-AGR052NCHU-MEgradu2NCHU-Mount2NCHU_MBA972NCNUEM2NDHU-phy1022NewAge2NKUTEE2NSYSU_EE95-12ntnuch95c2NTOU-EBFS932NTPU-CSIE982NTUEE_LAB2062NTUST-TX-B962Patent2Peter_EN2PHP2PttHistory2PublicServan2PushDoll2SayLove2SuperBike2Tainan2THU_BA20002transgender2Yup-mwgc2Yup03-042About_Life1AD_NCCU_VB1Ancient1Android1Anti-ramp1ASHS-93-li1AU_Talk1Aviation1B98A013XX1Badminton1Beauty1BigSanchung1bookhouse1Browsers1Bus1Butterfly1C_ChatBM1CareerLady1ChangHua1Cheer1Childhood1CHSH-96-3101Civil1ck46th3311ck47th3201ck55th3071ck55th3201ck57th3211ck58th3241cksh82nd3211clmusic1Comic1consumer1CPSHS10th3031Cross_Life1CrossGate1CSI1CSMU-D991customers1dance1DIABLO1digger1DJ_fightman1DummyHistory1Editor1Employee1EuropeTravel1Facebook1facelift1Fiction1FishShrimp1FJU-Family1Fooyin1GuildWars1GUNNM1HanDian1HRM1HSNU_10351HSNU_10651HSNU_10951HSNU_11421Hualien1ILSH-973091Instant_Mess1japanavgirls1jhs_30_51JOJO1joke1kawaii1KERORO1KingdomHuang1KNU1KS90-3111KS92-3161KS93-3171KS94-3121KS95-3211KS96-3151KS97-3101KS97-3131KS97-3181KS97-3201KS_PMAC1Lifeismoney1Lineage1LTK1M_Manson1marvel1meditation1MIT1Modchip1MRT1Nantou1NatureSeeker1Navy1NBAEasyChat1NCCU-YP1NCCU06_JAPAN1NCCU08_LawB1NCCU_PubLaw1NCCU_SEED1NCHU-FS981NCHU-MKT991NCKU_CSIE931NCKU_MEPhC1NCTU_HARCLUB1NCU97ME-B1NDHU1NDHU_ACC_5TH1NKNU_Phy0981NPUST1NSYSU_MSOE991NTHU_EDA2231NTHU_HIS971NTHU_IEEM-941NTHUTL981NTNU-HISBK1NTNUMasSport1NTPU-COECO951NTPU-CSIE961NTPU-STAT951NTU1NTUGIEE_RFIC1NTUMBA-981NTUphy971NTUST_Talk1NTUT_ME495A1NYUST00_FING1Old-Games1PCCU_Talk1peianyang1PingTung1Printer_scan1PttLifeLaw1RO1Rock_OE1RPGMaker1RumikoTWorld1SailorMoon1ScienceNote1SCU_Law101D1Seiya1ShowOff1SHU-JourM981Shu-Lin1ShuangHe1SongShan1SOS1Spain1SSSH-09th1141StoneAge1SuperHeroes1Supermission1Supernatural1SWORD1TA_AN1Taipei1tajen1TamShui1Taoism1TFSHS61st3211TFSHS67th3211TFSHS68th3211Tin-Ha1TNFSH98th1translator1TTU-AFL1TTU-talk1TY_Research1TypeMoon1Volleyball1WarHammer1Wego5-yi1WorkanTravel1WorkinChina1YUGIOH1YZU_EE96B1YZU_MLSB1YZUfinGrad961ZQ-Physics1<< 收起看板(343)
4F→:你說想不出來是任何一個基本解都想不出來嗎?03/17 13:28
2F→:上面那推文我沒看懂。至少自己知道怎麼做01/23 21:23
3F→:你的交換條件是隨便二個交換即可,還是要相鄰二個交換而已?01/05 23:35
7F推:這種問題,一般認定為文件相似度的識別. 有一種處理法是用01/02 11:26
8F→:貝式機率/頻率方式幫助判斷.01/02 11:27
1F→:另一個問題是,你怎麼肯定想要找O(n+m)的解?06/09 09:41
14F→:我看你要先把一個問題定清楚：06/09 13:28
15F→:怎06/09 13:29
16F→:麼說pattern case可以拉到討論O(m)的程度。06/09 13:30
17F→:以本例來看，只明確看到你要找二個offsets：0，306/09 13:32
18F→:二個Offsets相關字元都是X。另外，別的位子是否not X也可以06/09 13:35
19F→:現在具體的pattern很小，整個其實化約成O(n)了。06/09 13:38
23F→:你認為我否定問題？我認為我是幫他補強問題06/09 18:15
24F→:如果你不認同我的看法，可以發表你自己的解。不必無謂相爭06/09 18:17
25F→:原po應該可以參考這篇:06/09 22:55
26F→:http://en.wikipedia.org/wiki/Suffix_tree06/09 22:55
27F→:所討論的不是相同的問題,但有很接近目標的感覺.06/09 22:58
33F→:log的出現通常跟tree有關係06/10 21:17
3F推:那如果是將A-C,C-B的longest path以union方式銜接,可以解嗎?11/01 09:25
5F→:這你不用管.11/01 10:04
2F→:當然是隨機延伸,重點是要長得很像通道而不是程式產生的路.10/16 11:01
3F→:我錯了,這個方法跟f(N)->解一樣是有重覆的...計算分支的裁08/12 19:05
4F→:切還是必須做的動作. 待會另貼其他解.08/12 19:06
1F→:Prolog的演算法,可以算是DFS,backtracking.08/11 21:43
2F→:你的描述看起來,同時講了好幾個問題. 不妨區分為不同的問題08/12 04:17
3F→:就不同的目標解決.08/12 04:17