Đế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.Nhập môn C ++

0.1Brute Force 0.2.1Observations and Invariants 0.2.2Big Integers 0.3Prefix Sum 0.4.1Sorting Algorithms 0.4.2Sorting in C++0.5Greedy 0.6.1Binary Search 0.6.2Ternary Search 0.7Two Pointers 0.8Backtracking 0.9.1Divisibility, GCD and Primes 0.9.2Divisors and Euler Totient 0.9.3Fast Power and Modular Inverse 0.9.4Fibonacci Numbers 0.9.5Combinatorics 0.9.6Inclusion Exclusion 0.10.1STL Containers 0.10.2Monotonic Stack and Queue 0.10.3Priority Queue

1.1Meet in the Middle 1.2Divide and Conquer 1.3.1Introduction to DP 1.3.2DP on Sequences 1.3.3Knapsack 1.3.4Knapsack Variants 1.3.5Interval DP 1.4Digit DP 1.5Bitwise Operations 1.6Bitmask DP 1.7.1Fenwick Tree 1.7.22D Fenwick Tree 1.8.1Segment Tree 1.8.2Lazy Propagation 1.9Matrix Multiplication 1.10.1Hashing 1.10.2Manacher Algorithm

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

3.1DFS and BFS 3.2.1Euler Tour 3.2.2Small to Large Merging 3.3Topological Sort 3.4.1Tree DP 3.4.2Tree Knapsack 3.4.3Rerooting DP 3.5.1Dijkstra Algorithm 3.5.2Bellman-Ford and Floyd-Warshall 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.6SOS DP 4.7Extended Euclidean Algorithm 4.8Z Function 4.9.1Maximum Flow 4.9.2Flow Modeling 4.9.3Minimum Cost Flow 4.9.4Faster Flow Algorithms

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

6.1CDQ Divide and Conquer 6.2XOR Basis 6.3Gaussian Elimination 6.4Suffix Structures 6.5Matching 6.6Balanced Binary Search Tree 6.7Segment Tree Beats 6.8Centroid Decomposition 6.9FFT and NTT 6.10.1Basic Geometry 6.10.2Convex Hull 6.10.3Circles

7.1Möbius Function 7.2Lagrange Interpolation 7.3.1Binomials Modulo Any Number 7.3.2Lattice Path Counting 7.3.3Burnside Lemma 7.3.4Primitive Roots and Discrete Logarithm 7.4Aho Corasick 7.5Rollback 7.6Li Chao Tree 7.7.1Trees Built from Arrays and Graphs 7.7.2Virtual Tree 7.7.3Link Cut Tree 7.7.4Palindromic Tree 7.82-SAT 7.9Aliens Trick 7.10Slope Trick

8.1Matroids 8.2Generating Functions 8.3Heuristics

9.1Stress Testing and Debugging 9.2Pragmas and Constant Factor 9.3IOI and APIO Task Formats 9.4Before, During and After the Contest 9.5Major Contests and Advice

Lộ trình/Chương 0/Bài 0.10.2

Chương 0·Bài 0.10.2

Monotonic Stack and Queue

Bài học Bài tập 10

1

Xóa Mẫu ABCcanuc80k0903

LQDOJ

2

Chỉ Số Nhỏ Hơn Gần Nhấtcanuc80k0929

LQDOJ

3

Hình Chữ Nhật Dưới Đường Cộtcanuc80k1132

LQDOJ

4

Tổng Không Vượt Đỉnhcanuc80k2230

LQDOJ

5

Bộ Lọc Xâucanuc80k1915

LQDOJ

6

Số Nhỏ Nhất Sau Khi Xóacanuc80k2217

LQDOJ

7

Tổng Số Vé Tối Thiểucanuc80k2238

LQDOJ

8

Điểm Đoạn Lớn Nhấtcanuc80k2240

LQDOJ

9

Người Trẻ Hơn Xa Nhấtcanuc80k2247

LQDOJ

10

Cặp Ký Tự Biến Mấtcanuc80k5207

LQDOJ

Bài tập LQDOJ dành cho tài khoản Pro

Mở khóa bằng tài khoản Pro

Bài 0.10.1STL Containers Bài 1.1 Meet in the Middle

Canuc80k CP

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