shareoi
算法竞赛课件分享
Learn how Gaussian elimination solves XOR systems efficiently in linear algebra. Discover O(n*m) solutions over GF(2) by treating XOR as addition. Explore this powerful technique now.
Using Fourier Transforms for Polynomial Multiplication in Competitive Programming: A Complete GuideMaster polynomial multiplication with Fourier Transforms in competitive programming. Learn how FFT speeds up calculations from O(n^2) to O(n log n) with this guide.
How to Solve Knapsack Problems Using Dynamic Programming: A Complete GuideMaster knapsack problems with dynamic programming. Discover how to define states and apply transitions to maximize value efficiently. Learn the complete guide now.
Computational Geometry Primitives in ShareOI: Convex Hull and Rotating Calipers ResourcesExplore computational geometry primitives like convex hull and rotating calipers in the hzwer/shareoi repository. Find lecture slides on theory but not direct code implementations.
State Compression DP for Graph Connectivity Problems: Algorithms and ImplementationsLearn state compression DP for graph connectivity. Encode vertex subsets with bitmasks to solve complex problems like Steiner trees efficiently. Explore algorithms and implementations.
Applying Divide and Conquer on Trees: Centroid Decomposition Techniques from the shareOI RepositoryMaster tree divide and conquer with centroid decomposition from shareOI. Solve path and distance problems efficiently in O(N log N) time. Explore advanced algorithms today!
Modeling Combinatorial Problems Using Flow Graphs: A Complete GuideLearn to model combinatorial problems with flow graphs. This guide explains how vertices, edges, and capacities unlock solutions with max flow and min cut algorithms.
How to Implement Persistent Segment Trees for Versioned Data QueriesLearn to implement persistent segment trees for efficient versioned data queries. Store historical array versions and query past states in O(log n) time. Master this advanced data structure.
Link-Cut Trees (LCT): Key Operations and Applications for Dynamic ForestsExplore Link-Cut Trees (LCT) for dynamic forests. Master key operations like link and cut in O(log N) time and discover their applications in graph algorithms.
Implementing Binary Lifting for LCA and Ancestor Queries on TreesImplement binary lifting for efficient LCA and ancestor queries on trees. Preprocess in O(N log N) for O(log N) query time.
Heavy-Light Decomposition vs Tree Chain Decomposition: Key Differences and Implementation GuideExplore heavy-light decomposition vs tree chain decomposition. Discover how HLD optimizes TCD for O(log N) path queries and learn implementation essentials.
Fundamentals of Combinatorial Game Theory Using SG Functions: A Complete GuideMaster combinatorial game theory with SG functions. Learn how the mex rule and XOR operations simplify complex impartial games into Nim heaps, making them solvable. Your complete guide.
Have a question about this repo?
These articles cover the highlights, but your codebase questions are specific. Give your agent direct access to the source. Share this with your agent to get started:
curl -s "https://instagit.com/install.md" 
Maintain an open-source project? Get it listed too →