---

轉一下喵幾個神等級同學整理的好東西吧XD

實用連結：
DJWS
Nocow
Algowiki
USACO
uva
ACM
PKU
ACM社群

題型：
Graph:

    Strongly connected component
    Floyd Warshall
    Dijkstra (Normal or with heap)
    SPFA
    Maxflow (BFS is Edmond-Karp  DFS is Ford-Fulkerson Third is Pre-flow)
    Minimum Vertex Covering
    Bipartile matching (Maxflow or Hungary algorithm)
    Minimum Cut
    Biconnected Component
    Minimum Cost Flow (算藝326頁 Johnson's algorithms with maxflow or
                        Bellman ford with maxflow)
    Euler Circuit
    Hamilition Circuit
    Johnson's algorithms http://www.csie.ntnu.edu.tw/~u91029/Path.html
    Directed Euler

Tree:

    Kth - min Spanning Tree (算藝第300頁)
    Tree
    Binary tree
    Heap
    Minimum Spanning Tree (Kruskal or Prim Algorithms)
    Binary Search Tree
    Huffman
    Union and find
    Segment Tree
    Ranking Tree
    Tree Reconstruction
    Red Black Tree

List:

    Linked List
    Double end linked List

Search:

    Sequential Search
    Binary Search

Network:

    Topological Sort
    Activity on edge
    Activity on vertex

Sort:

    Quicksort
    Mergesort
    Bubblesort

DP:
    Optimal Binary Search Tree
    Tree Dyanmic Programming
Recurse:

    IDA* Search
    A* Search
    Branch and bound (BFS)
    Min - Max Tree
    Backtracing (DFS)
    DFS or BFS with cut
    DFS with heuristic function and bound
    Linear Josephus Problem Solution

Other:

    Closest Pair
    KMP
    Convex Hull
    Math!
    Linear sieve
    Brute Force - * XD
    Golden Section
    Geometry
    RMQ

To be read：
    Canonical Hamiliton
    Bipartite Minimum cost maximum flow (KM algorithm)
    Multi trie
    Suffix Tree
    KM Algorithms
    Simplex
    Directed Minimum Spanning Tree
    LCA
    2 - SAT http://0rz.tw/9ZlGV
    Lower bound maximum flow
    Monge Matrix
    Hopcroft Bipartite Matching
    +-1 RMQ


ACM題目難度分類：

1.難度一 41題
100 272 458 476 477 488 494 579 591 913
10018 10035 10038 10055 10062 10071 10082 10107 10141 10209
10222 10300 10340 10370 10473 10499 10550 10589 10673 10696
10783 10789 10812 10878 10903 10924 10929 10963 11059 11172
11185

【簡單題】站長分類，共15題
264, 369, 382, 408, 455, 550, 834, 10110，10195, 10286,
10297, 10302, 10327, 10346, 10493

2.難度二 94題
101, 102, 107, 113, 118, 127, 145, 155, 170, 253,
256, 264, 294, 340, 343, 350, 355, 356, 357, 382,
386, 392, 402, 406, 412, 445, 446, 478, 482, 483,
484, 490, 492, 498, 516, 530, 543, 555, 568, 573,
576, 587, 612, 661, 679, 686, 694, 729, 825, 834,
846, 10008, 10010, 10014, 10015, 10041, 10056, 10105, 10106, 10112,
10161, 10167, 10188, 10189, 10193, 10196, 10200, 10219, 10223, 10235,
10242, 10258, 10268, 10284, 10286, 10287, 10295, 10298, 10302, 10310,
10326, 10327, 10346, 10361, 10365, 10377, 10409, 10443, 10489, 10491,
10515, 10573, 10591, 10622

3.難度三  193題
103, 105, 108, 111, 112, 115, 116, 120, 122, 124,
128, 131, 136, 138, 142, 146, 153, 161, 167, 190,
191, 195, 200, 202, 216, 245, 254, 257, 270, 271,
273, 290, 291, 305, 306, 311, 315, 332, 333, 336,
348, 369, 374, 375, 378, 409, 417, 424, 429, 435,
437, 438, 439, 441, 442, 451, 455, 459, 471, 474,
485, 489, 495, 496, 497, 514, 524, 532, 534, 536,
537, 544, 548, 562, 572, 574, 583, 598, 615, 619,
623, 624, 640, 668, 673, 674, 699, 706, 713, 725,
748, 750, 755, 762, 763, 793, 847, 861, 10000, 10003,
10004, 10006, 10017, 10025, 10026, 10032, 10034, 10042, 10048, 10049,
10063, 10066, 10067, 10074, 10079, 10083, 10093, 10098, 10099, 10102,
10104, 10110, 10120, 10126, 10127, 10131, 10137, 10139, 10140, 10147,
10152, 10154, 10162, 10165, 10168, 10170, 10176, 10179, 10182, 10183,
10191, 10195, 10199, 10212, 10215, 10220, 10226, 10229, 10232, 10233,
10257, 10276, 10282, 10283, 10285, 10289, 10297, 10299, 10305, 10311,
10315, 10324, 10329, 10334, 10336, 10338, 10344, 10345, 10359, 10374,
10375, 10386, 10391, 10392, 10393, 10394, 10404, 10405, 10407, 10408,
10450, 10465, 10474, 10484, 10487, 10496, 10518, 10519, 10527, 10533,
10539, 10551, 10566



--
※ 來源: DISP BBS 看板: AllanCat 文章連結: http://disp.cc/b/67-36c
※ 作者: AllanCat  來自: 140.113.172.146  時間: 2010-06-11 00:39:38