[kuangbin带你飞]专题1-23

{"likeCnt":241,"createTime":"Aug 7, 2017 10:34:41 AM","author":"takanashirin","viewCnt":25495,"id":187,"title":"[kuangbin带你飞]专题1-23","trustable":false,"dislikeCnt":0,"content":"专题一 简单搜索\t\t\n\t[problem:POJ-1321]\t棋盘问题\n\t[problem:POJ-2251]\tDungeon Master\n\t[problem:POJ-3278]\tCatch That Cow\n\t[problem:POJ-3279]\tFliptile\n\t[problem:POJ-1426]\tFind The Multiple\n\t[problem:POJ-3126]\tPrime Path\n\t[problem:POJ-3087]\tShuffle\u0027m Up\n\t[problem:POJ-3414]\tPots\n\t[problem:FZU-2150]\tFire Game\n\t[problem:UVA-11624]\tFire!\n\t[problem:POJ-3984]\t迷宫问题\n\t[problem:HDU-1241]\tOil Deposits\n\t[problem:HDU-1495]\t非常可乐\n\t[problem:HDU-2612]\tFind a way\n\t\t\n专题二 搜索进阶 \t\t\n\t[problem:HDU-1043]\tEight\n\t[problem:HDU-3567]\tEight II\n\t[problem:HDU-2181]\t哈密顿绕行世界问题\n\t[problem:HDU-3533]\tEscape\n\t[problem:HDU-1560]\tDNA sequence\n\t[problem:ZOJ-2477]\tMagic Cube\n\t[problem:HDU-3085]\tNightmare Ⅱ\n\t[problem:HDU-1067]\tGap\n\t[problem:HDU-2102]\tA计划\n\t[problem:HDU-3001]\tTravelling\n专题三 Dancing Links\t\t\n\t[problem:HUST-1017]\tExact cover\n\t[problem:ZOJ-3209]\tTreasure Map\n\t[problem:HDU-2295]\tRadar\n\t[problem:FZU-1686]\t神龙的难题\n\t[problem:POJ-1084]\tSquare Destroyer\n\t[problem:POJ-3074]\tSudoku\n\t[problem:ZOJ-3122]\tSudoku\n\t[problem:HDU-4069]\tSquiggly Sudoku\n\t[problem:HDU-3335]\tDivisibility\n\t[problem:HDU-4979]\tA simple math problem.\n\t[problem:HDU-5046]\tAirport\n专题四 最短路练习\t\t\n\t[problem:POJ-2387]\tTil the Cows Come Home\n\t[problem:POJ-2253]\tFrogger\n\t[problem:POJ-1797]\tHeavy Transportation\n\t[problem:POJ-3268]\tSilver Cow Party\n\t[problem:POJ-1860]\tCurrency Exchange\n\t[problem:POJ-3259]\tWormholes\n\t[problem:POJ-1502]\tMPI Maelstrom\n\t[problem:POJ-3660]\tCow Contest\n\t[problem:POJ-2240]\tArbitrage\n\t[problem:POJ-1511]\tInvitation Cards\n\t[problem:POJ-3159]\tCandies\n\t[problem:POJ-2502]\tSubway\n\t[problem:POJ-1062]\t昂贵的聘礼\n\t[problem:POJ-1847]\tTram\n\t[problem:LightOJ-1074]\tExtended Traffic\n\t[problem:HDU-4725]\tThe Shortest Path in Nya Graph\n\t[problem:HDU-3416]\tMarriage Match IV\n\t[problem:HDU-4370]\t0 or 1\n\t[problem:POJ-3169]\tLayout\n\t\t\n专题五 并查集\t\t\n\t[problem:POJ-2236]\tWireless Network\n\t[problem:POJ-1611]\tThe Suspects\n\t[problem:HDU-1213]\tHow Many Tables\n\t[problem:HDU-3038]\tHow Many Answers Are Wrong\n\t[problem:POJ-1182]\t食物链\n\t[problem:POJ-1417]\tTrue Liars\n\t[problem:POJ-1456]\tSupermarket\n\t[problem:POJ-1733]\tParity game\n\t[problem:POJ-1984]\tNavigation Nightmare\n\t[problem:POJ-2492]\tA Bug\u0027s Life\n\t[problem:POJ-2912]\tRochambeau\n\t[problem:ZOJ-3261]\tConnections in Galaxy War\n\t[problem:HDU-1272]\t小希的迷宫\n\t[problem:POJ-1308]\tIs It A Tree?\n\t\t\n专题六 最小生成树\t\t\n\t[problem:POJ-1251]\tJungle Roads\n\t[problem:POJ-1287]\tNetworking\n\t[problem:POJ-2031]\tBuilding a Space Station\n\t[problem:POJ-2421]\tConstructing Roads\n\t[problem:ZOJ-1586]\tQS Network\n\t[problem:POJ-1789]\tTruck History\n\t[problem:POJ-2349]\tArctic Network\n\t[problem:POJ-1751]\tHighways\n\t[problem:POJ-1258]\tAgri-Net\n\t[problem:POJ-3026]\tBorg Maze\n\t[problem:POJ-1679]\tThe Unique MST\n\t[problem:HDU-1233]\t还是畅通工程\n\t[problem:HDU-1301]\tJungle Roads\n\t[problem:HDU-1875]\t畅通工程再续\n\t\t\n专题七 线段树\t\t\n\t[problem:HDU-1166]\t敌兵布阵\n\t[problem:HDU-1754]\tI Hate It\n\t[problem:POJ-3468]\tA Simple Problem with Integers\n\t[problem:POJ-2528]\tMayor\u0027s posters\n\t[problem:HDU-1698]\tJust a Hook\n\t[problem:ZOJ-1610]\tCount the Colors\n\t[problem:POJ-3264]\tBalanced Lineup\n\t[problem:HDU-4027]\tCan you answer these queries?\n\t[problem:HDU-1540]\tTunnel Warfare\n\t[problem:HDU-3974]\tAssign the task\n\t[problem:HDU-4578]\tTransformation\n\t[problem:HDU-4614]\tVases and Flowers\n\t[problem:HDU-4553]\t约会安排\n\t[problem:POJ-1177]\tPicture\n\t[problem:HDU-1255]\t覆盖的面积\n\t[problem:HDU-1542]\tAtlantis\n\t[problem:HDU-3642]\tGet The Treasury\n\n专题八 生成树\n\t[problem:POJ-1679]\tThe Unique MST\n\t[problem:HDU-4081]\tQin Shi Huang\u0027s National Road System\n\t[problem:UVA-10600]\tACM Contest and Blackout\n\t[problem:UVA-10462]\tIs There A Second Way Left?\n\t[problem:POJ-3164]\tCommand Network\n\t[problem:UVA-11183]\tTeen Girl Squad\n\t[problem:HDU-2121]\tIce_cream’s world II\n\t[problem:HDU-4009]\tTransfer water\n\t[problem:UVA-10766]\tOrganising the Organisation\n\t[problem:SPOJ-DETER3]\tFind The Determinant III\n\t[problem:URAL-1627]\tJoin\n\t[problem:HDU-4305]\tLightning\n\t[problem:HDU-4408]\tMinimum Spanning Tree\n\t[problem:SPOJ-HIGH]\tHighways\n\t\t\n专题九 连通图\t\t\n\t[problem:POJ-1236]\tNetwork of Schools\n\t[problem:UVA-315]\tNetwork\n\t[problem:UVA-796]\tCritical Links\n\t[problem:POJ-3694]\tNetwork\n\t[problem:POJ-3177]\tRedundant Paths\n\t[problem:HDU-4612]\tWarm up\n\t[problem:HDU-4635]\tStrongly connected\n\t[problem:HDU-4685]\tPrince and Princess\n\t[problem:HDU-4738]\tCaocao\u0027s Bridges\n专题十 匹配问题\t\t\n\t[problem:HDU-1045]\tFire Net\n\t[problem:HDU-2444]\tThe Accomodation of Students\n\t[problem:HDU-1083]\tCourses\n\t[problem:HDU-1281]\t棋盘游戏\n\t[problem:HDU-2819]\tSwap\n\t[problem:HDU-2389]\tRain on your Parade\n\t[problem:HDU-4185]\tOil Skimming\n\t[problem:POJ-3020]\tAntenna Placement\n\t[problem:HDU-1054]\tStrategic Game\n\t[problem:HDU-1151]\tAir Raid\n\t[problem:POJ-2594]\tTreasure Exploration\n\t[problem:HDU-3829]\tCat VS Dog\n\t[problem:POJ-2289]\tJamie\u0027s Contact Groups\n\t[problem:POJ-2112]\tOptimal Milking\n\t[problem:POJ-3189]\tSteady Cow Assignment\n\t[problem:HDU-2255]\t奔小康赚大钱\n\t[problem:HDU-3488]\tTour\n\t[problem:URAL-1099]\tWork Scheduling\n\t[problem:HDU-4687]\tBoke and Tsukkomi\n专题十一 网络流\n\t[problem:POJ-3436]\tACM Computer Factory\n\t[problem:POJ-3281]\tDining\n\t[problem:POJ-1087]\tA Plug for UNIX\n\t[problem:POJ-2195]\tGoing Home\n\t[problem:POJ-2516]\tMinimum Cost\n\t[problem:POJ-1459]\tPower Network\n\t[problem:HDU-4280]\tIsland Transport\n\t[problem:HDU-4292]\tFood\n\t[problem:HDU-4289]\tControl\n\t[problem:UVA-10480]\tSabotage\n\t[problem:HDU-2732]\tLeapin\u0027 Lizards\n\t[problem:HDU-3338]\tKakuro Extension\n\t[problem:HDU-3605]\tEscape\n\t[problem:HDU-3081]\tMarriage Match II\n\t[problem:HDU-3416]\tMarriage Match IV\n专题十二 基础DP1\n\t[problem:HDU-1024]\tMax Sum Plus Plus\n\t[problem:HDU-1029]\tIgnatius and the Princess IV\n\t[problem:HDU-1069]\tMonkey and Banana\n\t[problem:HDU-1074]\tDoing Homework\n\t[problem:HDU-1087]\tSuper Jumping! Jumping! Jumping!\n\t[problem:HDU-1114]\tPiggy-Bank\n\t[problem:HDU-1176]\t免费馅饼\n\t[problem:HDU-1260]\tTickets\n\t[problem:HDU-1257]\t最少拦截系统\n\t[problem:HDU-1160]\tFatMouse\u0027s Speed\n\t[problem:POJ-1015]\tJury Compromise\n\t[problem:POJ-1458]\tCommon Subsequence\n\t[problem:POJ-1661]\tHelp Jimmy\n\t[problem:POJ-2533]\tLongest Ordered Subsequence\n\t[problem:POJ-3186]\tTreats for the Cows\n\t[problem:HDU-1078]\tFatMouse and Cheese\n\t[problem:HDU-2859]\tPhalanx\n\t[problem:POJ-3616]\tMilking Time\n\t[problem:POJ-3666]\tMaking the Grade\n专题十三 基础计算几何\n\t[problem:POJ-2318]\tTOYS\n\t[problem:POJ-2398]\tToy Storage\n\t[problem:POJ-3304]\tSegments\n\t[problem:POJ-1269]\tIntersecting Lines\n\t[problem:POJ-1556]\tThe Doors\n\t[problem:POJ-2653]\tPick-up sticks\n\t[problem:POJ-1066]\tTreasure Hunt\n\t[problem:POJ-1410]\tIntersection\n\t[problem:POJ-1696]\tSpace Ant\n\t[problem:POJ-3347]\tKadj Squares\n\t[problem:POJ-2826]\tAn Easy Problem?!\n\t[problem:POJ-1039]\tPipe\n\t[problem:POJ-3449]\tGeometric Shapes\n\t[problem:POJ-1584]\tA Round Peg in a Ground Hole\n专题十四 数论基础\n\t[problem:LightOJ-1370]\tBi-shoe and Phi-shoe\n\t[problem:LightOJ-1356]\tPrime Independence\n\t[problem:LightOJ-1341]\tAladdin and the Flying Carpet\n\t[problem:LightOJ-1336]\tSigma Function\n\t[problem:LightOJ-1282]\tLeading and Trailing\n\t[problem:LightOJ-1259]\tGoldbach`s Conjecture\n\t[problem:LightOJ-1245]\tHarmonic Number (II)\n\t[problem:LightOJ-1236]\tPairs Forming LCM\n\t[problem:LightOJ-1234]\tHarmonic Number\n\t[problem:LightOJ-1220]\tMysterious Bacteria\n\t[problem:LightOJ-1214]\tLarge Division\n\t[problem:LightOJ-1213]\tFantasy of a Summation\n\t[problem:LightOJ-1197]\tHelp Hanzo\n\t[problem:LightOJ-1138]\tTrailing Zeroes (III)\n\t[problem:UVA-11426]\tGCD - Extreme (II)\n\t[problem:UVA-11754]\tCode Feat\n\t[problem:UVA-11916]\tEmoogle Grid\n\t[problem:POJ-1061]\t青蛙的约会\n\t[problem:POJ-2115]\tC Looooops\n\t[problem:POJ-2116]\tDeath to Binary?\n\t[problem:HDU-2161]\tPrimes\n\t[problem:UVA-11827]\tMaximum GCD\n\t[problem:UVA-10200]\tPrime Time\n\t[problem:SGU-106]\tThe equation\n\t[problem:POJ-2478]\tFarey Sequence\n\t[problem:UVA-11752]\tThe Super Powers\n\n专题十五 数位DP\n\t[problem:CodeForces-55D]\tBeautiful numbers\n\t[problem:HDU-4352]\tXHXJ\u0027s LIS\n\t[problem:HDU-2089]\t不要62\n\t[problem:HDU-3555]\tBomb\n\t[problem:POJ-3252]\tRound Numbers\n\t[problem:HDU-3709]\tBalanced Number\n\t[problem:HDU-3652]\tB-number\n\t[problem:HDU-4734]\tF(x)\n\t[problem:ZOJ-3494]\tBCD Code\n\t[problem:HDU-4507]\t吉哥系列故事――恨7不成妻\n\t[problem:SPOJ-BALNUM]\tBalanced Numbers\n\n专题十六 KMP \u0026 扩展KMP \u0026 Manacher\n\t[problem:HDU-1711]\tNumber Sequence\n\t[problem:HDU-1686]\tOulipo\n\t[problem:HDU-2087]\t剪花布条\n\t[problem:HDU-3746]\tCyclic Nacklace\n\t[problem:HDU-1358]\tPeriod\n\t[problem:HUST-1010]\tThe Minimum Length\n\t[problem:POJ-2406]\tPower Strings\n\t[problem:POJ-2752]\tSeek the Name, Seek the Fame\n\t[problem:POJ-3080]\tBlue Jeans\n\t[problem:HDU-2594]\tSimpsons’ Hidden Talents\n\t[problem:HDU-3336]\tCount the string\n\t[problem:HDU-4300]\tClairewd’s message\n\t[problem:HDU-1238]\tSubstrings\n\t[problem:HDU-2328]\tCorporate Identity\n\t[problem:HDU-3374]\tString Problem\n\t[problem:HDU-2609]\tHow many\n\t[problem:FZU-1901]\tPeriod II\n\t[problem:POJ-3746]\tTeacher YYF\n\t[problem:HDU-3613]\tBest Reward\n\t[problem:POJ-3376]\tFinding Palindromes\n\t[problem:POJ-3974]\tPalindrome\n\t[problem:HDU-4513]\t吉哥系列故事――完美队形II\n\t[problem:HDU-3294]\tGirls\u0027 research\n\t[problem:HDU-3068]\t最长回文\n\t[problem:HDU-4847]\tWow! Such Doge!\n\t[problem:HDU-4763]\tTheme Section\n专题十七 AC自动机\n\t[problem:HDU-2222]\tKeywords Search\n\t[problem:HDU-2896]\t病毒侵袭\n\t[problem:HDU-3065]\t病毒侵袭持续中\n\t[problem:ZOJ-3430]\tDetect the Virus\n\t[problem:POJ-2778]\tDNA Sequence\n\t[problem:HDU-2243]\t考研路茫茫――单词情结\n\t[problem:POJ-1625]\tCensored!\n\t[problem:HDU-2825]\tWireless Password\n\t[problem:HDU-2296]\tRing\n\t[problem:HDU-2457]\tDNA repair\n\t[problem:ZOJ-3228]\tSearching the String\n\t[problem:HDU-3341]\tLost\u0027s revenge\n\t[problem:HDU-3247]\tResource Archiver\n\t[problem:ZOJ-3494]\tBCD Code\n\t[problem:HDU-4758]\tWalk Through Squares\n\t[problem:HDU-4511]\t小明系列故事――女友的考验\n\t\n专题十八 后缀数组\n\t[problem:POJ-1743]\tMusical Theme\n\t[problem:POJ-3261]\tMilk Patterns\n\t[problem:SPOJ-DISUBSTR]\tDistinct Substrings\n\t[problem:SPOJ-SUBST1]\tNew Distinct Substrings\n\t[problem:POJ-2406]\tPower Strings\n\t[problem:SPOJ-REPEATS]\tRepeats\n\t[problem:POJ-3693]\tMaximum repetition substring\n\t[problem:POJ-2774]\tLong Long Message\n\t[problem:POJ-3415]\tCommon Substrings\n\t[problem:POJ-3294]\tLife Forms\n\t[problem:SPOJ-PHRASES]\tRelevant Phrases of Annihilation\n\t[problem:POJ-1226]\tSubstrings\n\t[problem:UVA-11475]\tExtend to Palindrome\n\t[problem:POJ-3581]\tSequence\n\t[problem:POJ-3450]\tCorporate Identity\n\t[problem:POJ-3080]\tBlue Jeans\n\t[problem:POJ-2758]\tChecking the Text\n专题十九 矩阵\n\t[problem:CodeForces-450B]\tJzzhu and Sequences\n\t[problem:HDU-5015]\t233 Matrix\n\t[problem:HDU-4990]\tReading comprehension\n\t[problem:UVA-11651]\tKrypton Number System\n\t[problem:HDU-4965]\tFast Matrix Calculation\n\t[problem:UVA-11551]\tExperienced Endeavour\n\t[problem:UVA-10689]\tYet another Number Sequence\n\t[problem:UVA-11149]\tPower of Matrix\n\t[problem:UVA-10655]\tContemplation! Algebra\n\t[problem:UVA-1386]\tCellular Automaton\n\t[problem:UVA-10870]\tRecurrences\n\t[problem:UVA-11885]\tNumber of Battlefields\n\t[problem:HDU-4565]\tSo Easy!\n\t[problem:CodeForces-392C]\tYet Another Number Sequence\n\t[problem:CodeForces-385E]\tBear in the Field\n\t[problem:FZU-1911]\tConstruct a Matrix\n\t[problem:UVA-10518]\tHow Many Calls?\n\t[problem:HDU-4549]\tM斐波那契数列\n\t[problem:HDU-4686]\tArc of Dream\n专题二十 斜率DP\n\t[problem:HDU-3507]\tPrint Article\n\t[problem:HDU-2829]\tLawrence\n\t[problem:HDU-4528]\t小明系列故事――捉迷藏\n\t[problem:HDU-1300]\tPearls\n\t[problem:HDU-2993]\tMAX Average Problem\n\t[problem:UVALive-5097]\tCross the Wall\n\t[problem:HDU-3045]\tPicnic Cows\n\t[problem:HDU-3516]\tTree Construction\n\t[problem:POJ-1160]\tPost Office\n\t[problem:POJ-1180]\tBatch Scheduling\n\t[problem:POJ-2018]\tBest Cow Fences\n\t[problem:POJ-3709]\tK-Anonymous Sequence\n\t[problem:POJ-2841]\tNavigation Game\n\t[problem:POJ-1260]\tPearls\n\t[problem:UVA-12594]\tNaming Babies\n\t[problem:HDU-3480]\tDivision\n\t[problem:UVALive-6771]\tBuffed Buffet\n专题二十一 概率\u0026期望\n\t[problem:LightOJ-1027]\tA Dangerous Maze\n\t[problem:LightOJ-1030]\tDiscovering Gold\n\t[problem:LightOJ-1038]\tRace to 1 Again\n\t[problem:LightOJ-1079]\tJust another Robbery\n\t[problem:LightOJ-1104]\tBirthday Paradox\n\t[problem:LightOJ-1151]\tSnakes and Ladders\n\t[problem:LightOJ-1248]\tDice (III)\n\t[problem:LightOJ-1265]\tIsland of Survival\n\t[problem:LightOJ-1274]\tBeating the Dataset\n\t[problem:LightOJ-1284]\tLights inside 3D Grid\n\t[problem:LightOJ-1287]\tWhere to Run\n\t[problem:LightOJ-1317]\tThrowing Balls into the Baskets\n\t[problem:LightOJ-1321]\tSending Packets\n\t[problem:LightOJ-1342]\tAladdin and the Magical Sticks\n\t[problem:LightOJ-1364]\tExpected Cards\n\t[problem:LightOJ-1395]\tA Dangerous Maze (II)\n\t[problem:LightOJ-1408]\tBatting Practice\n专题二十二 区间DP\t\t\n\t[problem:ZOJ-3537]\tCake\n\t[problem:LightOJ-1422]\tHalloween Costumes\n\t[problem:POJ-2955]\tBrackets\n\t[problem:CodeForces-149D]\tColoring Brackets\n\t[problem:POJ-1651]\tMultiplication Puzzle\n\t[problem:ZOJ-3469]\tFood Delivery\n\t[problem:HDU-4283]\tYou Are the One\n\t[problem:HDU-2476]\tString painter\n\t\t\n专题二十三 计算几何之半平面交\t\t\n\t[problem:POJ-3335]\tRotating Scoreboard\n\t[problem:POJ-3130]\tHow I Mathematician Wonder What You Are!\n\t[problem:POJ-1474]\tVideo Surveillance\n\t[problem:POJ-1279]\tArt Gallery\n\t[problem:POJ-3525]\tMost Distant Point from the Sea\n\t[problem:POJ-3384]\tFeng Shui\n\t[problem:POJ-1755]\tTriathlon\n\t[problem:POJ-2540]\tHotter Colder\n\t[problem:POJ-2451]\tUyuw\u0027s Concert\n\t[problem:POJ-1271]\tNice Milk\n\t[problem:UVA-11722]\tJoining with Friend\n"}