Rehabilitation plan

Here is the rehabilitation plan it! Although actually I just put before the archive copy again just it, of course I added some basic things in there it is.

Plan intends to start (as long as no cushions) in early July.

Feeling in the water blog ah ...... all right, no one should be (funny)

Behind the completion of a fight .

Graph Theory

Map building method

Shortest

Spanning Tree

Topological sorting

  Tarjan related

  2-SAT

  Euler

  Virtual Tree

  Yuan Fang tree

  Network Flow / Hungarian algorithm

    KM

    Maximum flow minimum percentage

    Cost Flow

    Bipartite graph matching

    Upper and lower bounds network flow

——————————————————————

Number Theory

Sieve

gcd/exgcd

Inverse

Cantor start, Cartland number, the number of Stirling

Lucas Theorem

  Mobius inversion

  01 points plan

  Gaussian elimination

  Fast Fourier Transform (FFT)

  Fast number theory transformation (NTT)

  Fast Walsh Transform (FWT)

  Linear yl

  Matrix Tree Theorem

  BSGS

  Primitive root

  Generating function (a polynomial, each of the index value, the coefficient for the program number, pay attention to weight!)

  Adaptive Simpson's method

——————————————————————

Computational Geometry

  Convex hull

  Half plane cross

——————————————————————

Minute Osamu

  Bipartite

    01 points plan

  Thirds

  Planar partition

  Tree divide and conquer

  CDQ partition

  Overall dichotomy

  Segment tree partition

——————————————————————

String algorithms

  KMP

  Trie

  Hash

  AC automaton

  Manacher / horse-drawn vehicles algorithms

  Suffix array

  Suffix automata

——————————————————————

data structure

  Segment tree

  Fenwick tree

  st table

  Tree chain split

  Leftist tree

  Balanced tree

  Chairman of the tree

  Dynamic tree

  Trie

——————————————————————

DP / Dynamic Programming

  DP tree

  DP range

  Shaped pressure DP

  Digital DP

  DP plug

  Matrix Multiplication

  1D1D / slope optimization

——————————————————————

Violence algorithm

  IDA *

  Binary search

  Block

  Mo team

  Promiscuity (simulated annealing, climbing and the like)

——————————————————————

other

Probability expectations

The largest sub-rectangles

Monotonous queue

Reproduced in: https: //www.cnblogs.com/luyouqi233/p/11077678.html

Guess you like

Origin blog.csdn.net/weixin_33794672/article/details/93680011