Đến nội dung chính

Lộ trình Bài tập Các cuộc thi Tài liệu

Lộ trình

B.1C++ Template B.2cin and cout B.3if and else B.4for and while B.5Functions B.6Arrays

0.1Brute Force 0.2Ad Hoc 0.3Prefix Sum 0.4Sorting 0.5Greedy 0.6Binary Search 0.7Two Pointers 0.8Backtracking 0.9Arithmetic 0.10C++ STL

1.1Meet in the Middle 1.2Divide and Conquer 1.3Dynamic Programming 1.4Digit DP 1.5Bitwise Operations 1.6Bitmask DP 1.7Fenwick Tree 1.8Segment Tree 1.9Matrix Multiplication 1.10Hashing

2.1Trie 2.2KMP 2.3Sparse Table 2.4Disjoint Set Union 2.5Sqrt Decomposition 2.6Mo's Algorithm 2.7Advanced DP 2.8Bitset 2.9Interactive Problems 2.10Constructive Algorithms

3.1DFS and BFS 3.2Euler Tour 3.3Topological Sort 3.4Rerooting DP 3.5Shortest Paths 3.6Binary Lifting 3.7Lowest Common Ancestor 3.8Minimum Spanning Tree 3.9DFS Tree 3.10Sweep Line

4.1Lexicographic DP 4.2Divide and Conquer DP and Knuth 4.3Convex Hull Trick 4.4Open and Close Interval Trick 4.5Broken Profile DP 4.62D Fenwick Tree 4.7SOS DP 4.8Extended Euclidean Algorithm 4.9Z Function 4.10Network Flow

5.1Eulerian Path 5.2Parallel Binary Search 5.3Ad Hoc Game Theory 5.4Sprague Grundy Theorem 5.5Chinese Remainder Theorem 5.6Probability 5.7Randomized Algorithms 5.8Ternary Search 5.9Heavy Light Decomposition 5.10Persistent Segment Tree

6.1CDQ Divide and Conquer 6.2XOR Basis 6.3Suffix Structures 6.4Gaussian Elimination 6.5Matching 6.6Balanced Binary Search Tree 6.7Segment Tree Beats 6.8Centroid Decomposition 6.9FFT and NTT 6.10Geometry

7.1Möbius Function 7.2Lagrange Interpolation 7.3Advanced Math 7.4Aho Corasick 7.5Rollback 7.6Li Chao Tree 7.7Advanced Trees 7.82-SAT 7.9Aliens Trick 7.10Slope Trick

Lộ trình/Chương 3/Bài 3.2/canuc80k3118

canuc80k3118·19/50

Tổng Truy Vấn Màu Trong Cây

Nộp bài trên LQDOJ

Bài 3.2 · Euler Tour

Bài trướcCấp Dưới Năng Lực Cao Hơn Bài sau Cây Tăng Trưởng Theo Thời Gian

Canuc80k CP

Bài tập Tài liệu Góp ý Quyền riêng tư