7. Summary

Source: Internet
Author: User

I am preparing to start school. I will record my questions in May 7 and August. I will review the questions later and make a summary!

 

Data structure:
  • Splay:
    • [Bzoj] 1503: [noi2004] splay)
    • [Bzoj] 1269: [ahoi2006] Text Editor (splay)
    • [Bzoj] 1507: [noi2003] Editor (splay)
  • Treap:
    • [Bzoj] 1862: [zjoi2006] Gamez game ranking system & 1056: [haoi2008] ranking system (treap + very careful)
    • [Bzoj] 3224: tyvj 1728 normal balance tree (an unscientific OJ)
  • Link-cut tree:
    • Link-cut tree of dynamic trees
    • [Bzoj] 2049: [sdoi2008] Cave cave Survey (LCT/and check set)
    • [Bzoj] 1036: [zjoi2008] Count (LCT/tree link Division)
    • [Bzoj] 2002: [hnoi2010] bounce Bullet Flying sheep (LCT)
  • Tree link partitioning:
    • [Spoj] 375. query on a tree (tree link Division)
    • Dynamic Tree (FOG) tree Segmentation
  • Tree Cover tree:
    • [Bzoj] 1901: zju2112 dynamic rankings ))
    • [Bzoj] 3196: tyvj 1730 binary forced Balance Tree (k-Small Interval + Decision Tree)
    • [Bzoj] 1901: zju2112 dynamic rankings (k-Small Interval + Decision Tree)
  • Chairman tree:
    • [Spoj] 10628. Count on a tree (LCA + chair tree + DFS order)
    • [Bzoj] 1146: [ctsc2008] Network Management Network (tree link splitting + line segment tree cover Balance Tree + binary/DFS sequence + tree array + Chairman tree)
    • [Poj] 2104 k-th number (range K + chair tree)
    • Chair tree
  • Tree array:
    • [Bzoj] 1878: [sdoi2009] HH necklace (tree array)
    • [Bzoj] 1012: [jsoi2008] maxnumber (tree array + maximum range)
  • Line Segment tree:
    • [Poj] 2828 buy tickets (line segment tree + special skills/splay)
    • [Wikioi] 2216 planetary sequence (line tree)
    • [Wikioi] 1690 switch lamp (line segment tree)
    • [Wikioi] 1191 K axis dyeing (line segment tree + water question)
    • [Bzoj] 3038: The question created by God in seven minutes 2 (line tree + violence)

 

Graph Theory:
  • Network stream:
    • [Wikioi] 1904 least path coverage problem (maximum stream + Question of the pitfalls + least path coverage)
    • [Wikioi] 1034 homes (maximum stream + special skills)
    • [Tyvj] 1982 weapons allocation (cost flow)
    • [Bzoj] 1877: [sdoi2009] morning run (maximum minimum fee)
    • [Wikioi] 1913 digital trapezoid problem (billing flow)
    • [Wikioi] 1033 game problems (cost Stream)
    • [Wikioi] 2 (cost stream) In 1227 square meters)
    • [Bzoj] 1834: [zjoi2010] network expansion (maximum flow + billing flow)
    • [Bzoj] 1934: [shoi2007] Vote Voting in good faith (network stream/-bipartite graph matching)
    • [Bzoj] 1066: [scoi2007] lizard (maximum Stream)
    • [Wikioi] 3 squares (maximum stream + maximum weight closed subgraph)
    • [Wikioi] 1922 server guard coexistence problem (network stream/Bipartite Graph Matching)
    • [Tyvj] 1338 QQ Farm (max stream + max weight closure diagram)
    • [Bzoj] 1221: [hnoi2001] software development (minimum cost and maximum flow)
    • Max weight closure diagram & [bzoj] 1497: [noi2006] Max profit
  • Bipartite graph:
    • [Wikioi] 1022 overwrite (Bipartite Graph Matching)
    • [Bzoj] 1191: [hnoi2006] Superhero hero (Bipartite Graph Matching)
    • [Bzoj] 1059: [zjoi2007] matrix game (bipartite matching)
  • Shortest Path:
    • [Cogs] 147. [usaco jan08] Build a telephone line (Binary + spfa)
    • [Poj] 3255 roadblocks (Short Circuit + spfa)
    • [Poj] 1062 expensive spfa)
    • [Poj] 2449 remmarguts 'date (K short circuit)
    • [Wikioi] 1269 Hungary game (Short Circuit + spfa)
    • [Bzoj] 1295: [scoi2009] longest distance (spfa + brute force)
    • [Bzoj] 1491: [noi2007] dual diagram of Social Network (Floyd &&
    • [Bzoj] 1001: [beijing2006] The Wolf catches the rabbit (dual diagram + shortest circuit)
    • [Bzoj] 1003: [zjoi2006] Logistics and Transportation trans (spfa + dp)
  • Connectivity:
    • [Bzoj] 1051: [haoi2006] popular ox (Tarjan)
  • Query set:
    • [Bzoj] 1015: [jsoi2008] Star Wars Starwar (parallel query set)
  • Spanning Tree:
    • [Wikioi] 1002 (DFS + minimal spanning tree)
    • [Bzoj] 1821: [jsoi2010] group groups (Minimum Spanning Tree + greedy)
    • [Tyvj] 1307 contact person (Minimum Spanning Tree)
  • Recent common ancestor:
    • Recent common ancestor (LCA)
  • Basics:
    • Topological sorting
    • Bipartite Graph
    • Find the top cut Template

 

Dynamic Planning:
    • [Bzoj] 1040: [zjoi2008] server guard (ring tree DP)
    • [Bzoj] 1067: [scoi2007] rainfall (rmq + abnormal questions)
    • [Wikioi] 1403 New Three Kingdoms hegemony (DP + Kruskal)
    • [Wikioi] 2800 take-out (pressure DP + Floyd)
    • [Bzoj] 1087: [scoi2005] King (pressure DP)
    • [Bzoj] 1084: [scoi2005] maximum child matrix (DP)
    • [Bzoj] 3039: yubuyeong (DP/monotonous stack)
    • [Bzoj] 1270: [beijingwc2008] Lei Tao's kitten (DP + water question)
    • [Bzoj] 1002: [fjoi2007] rotavirus (DP + law + high precision)

 

String:
    • Suffix Array
    • AC Automation
    • KMP Template

 

Game theory:
    • [Poj] 2234 matches game (Game Theory)
    • [Poj] A new stone game (Game Theory)

 

Mathematics:
    • [Bzoj] 1076: [scoi2008] reward level (pressure DP + mathematical expectation)
    • Catalan count & noip2003 output stack sequence statistics
    • [Bzoj] 1008: [hnoi2008] jailbreak (quick power)

 

Search:
    • [Bzoj] 1054: [haoi2008] mobile toys (BFS + hash)
    • [Noip2003] Infectious Disease Control (-Greedy/DFS)
    • [Wikioi] 2495 jingting dance steps (A * + iterative deepening search)
    • [Wikioi] 1049 board dyeing (iterative deepening search)
    • [Bzoj] 1085: [scoi2005] server guard spirit (A * Heuristic Search)

 

Ry:
    • [Bzoj] 1007: [hnoi2008] horizontal visible straight line (Convex Shell)
    • [Cogs & usaco] 896. Round cow (convex bag)
    • [Bzoj] 1041: [haoi2008] integral point (ry) on the circle)

 

Special tips:
    • [Tyvj] 1359-revenue plan (two points)
    • [Bzoj] 2321: [beijing2011 training] star machine (Mathematics + special skills)
    • [Wikioi] 1553 mutex (hash + set)
    • [Bzoj] 1303: [cqoi2009] median diagram (Special tips)

 

Question:
    • [Cogs & usaco training] 710. Name the number (hash + water question + DFS)
    • [Bzoj] 2761: [jloi2011] No repeated numbers (set + jushui + ultra-pitfall)
    • [Wikioi] 1230 element search (jushui + set/hash)
    • [Wikioi] 1229 digital games (DFS + questions)
    • [Cogs] 714. usaco 1.3.2 mixed milk (Greedy + water question)
    • [Wikioi] 1108 Square Game (simulation)
    • [Bzoj] 1192: [hnoi2006] money bag of Guigu (water question)

7. Summary

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.