Difficulty: Hard, (8 personal rank)Keywords: Tarjan algo, bridge, DSU, Kruskal algo, MST
Keywords: Dijkstra’s Algorithm, DPDifficulty: 5 (AA)
keywords: Andrew’s Monotone Chain, convex hull, cross product
Keywords: greedy, Huffman Code
Codeforces 884D: Boxes And Balls
給n個箱子以及n種顏色的球。起初所有的球都放在第一個箱子裡面,現在我們可以做一個操作,從某個箱子中取出所有的球(該操作的成本等取出球的數量),並把這些球分放到k個箱子中,問要經過幾次操作才可以讓每個箱子只有一種顏色的球。
Keywords: range minimum query
Keywords: minimum height trees (MHTs), tree centroid, topological sort, centroid decomposition
Difficulty: Easy (8 personal rank)Keywords: Aho–Corasick algorithm
Difficulty: AA 5Keywords: k-th minimum BIT
Difficulty: Hard (10 personal rank)Keywords: DP