Cao Li's blog

Home Archives
2018
Nov 4

Something About Bipartite Graph

Oct 14

Fractional programming & Dinkelbach theorem

Sep 27

Connectivity & Tarjan Algorithm

Jul 15

Minimum Cut Problems

Jul 8

Codeforces 992E - Nastya and King-Shamans

Jul 7

Codeforces 995C Leaving the Bar

Jul 7

Subsets Property Merge

Jul 2

Geometry Basics

Jun 30

Max Flow Algorithm

Jun 10

Codeforces 984E Elevator

Categories

  • competitive programming

Tags

  • ad-hoc
  • algorithm
  • binary search
  • bipartite graph
  • brute force
  • cmake
  • codeforces
  • combinatorics
  • connectivity
  • cpp
  • data structure
  • dfs
  • dinkelbach theorem
  • dynamic programming
  • fractional programming
  • geometry
  • graph theory
  • maths
  • max-flow
  • minimum-cut
  • net
  • segment tree
  • square decomposition
  • state compression

Tag Cloud

ad-hoc algorithm binary search bipartite graph brute force cmake codeforces combinatorics connectivity cpp data structure dfs dinkelbach theorem dynamic programming fractional programming geometry graph theory maths max-flow minimum-cut net segment tree square decomposition state compression

Archives

  • November 2018
  • October 2018
  • September 2018
  • July 2018
  • June 2018
  • November 2017
  • October 2017
  • September 2017

Recent Posts

  • Something About Bipartite Graph
  • Fractional programming & Dinkelbach theorem
  • Connectivity & Tarjan Algorithm
  • Minimum Cut Problems
  • Codeforces 992E - Nastya and King-Shamans
© 2018 Cao Li
Powered by Hexo
Home Archives