Programming Contest Tips

Stuck? Pay attention to the bounds first

  • Brute force
  • Binary Search
  • Just simulation
  • Dynamic Programming
  • Geometry
    • Plane Sweep/Events
    • Convex Hull
  • Fenwick Tree/Segment Tree(with lazy propagation)
  • Simple Stack, Queue, PQ
  • Disjoint Set, Union/Find
  • Graph Search/ Graph
    • Search Backtracking
    • Topological Sort
    • Strongly Connected Component
    • Biconnected Component
    • DFS/BFS
    • Meet-in-the-middle technique
    • Shortest Path, Minimum Spanning Tree, Floyd Warshell, Bellman Ford
    • Euler Path/Circuit
    • Graph Coloring
    • LCA
  • 2-SAT
  • Math
    • Matrix Multiplication
    • Observation
    • Solving equation
    • Differential Equation
    • Calculus
    • Euclidean Algorithm
    • GCD/LCM
  • Minimum Path Cover
  • Maximum Flow/MinCostMaxFlow
  • Maximum Bipartite Matching
  • MinimumCut
  • String
    • Manacher Algorithm
    • Prefix Function
    • KMP
  • Randomized Algorithm
  • More optimization?

No comments:

Post a Comment