Courses Wiki Problems Contests Community Workspace

Miscellaneous

OverviewIntroduction to Miscellaneous Topics 400Discretization 401Two Pointers

▶Offline Algorithms

402Introduction to Offline Algorithms 403CDQ divide and conquer 404Parallel Binary Search

▶Mo's Algorithm

405Introduction to Mo's Algorithm 406Mo's algorithm 407Mo's Algorithm with Modifications 408Mo's Algorithm on Trees 409Rollback Mo's algorithm 410Two-dimensional Mo's Algorithm 411Mo's Algorithm: Secondary Offline Processing 412Mo's Algorithm with Bitsets

413Fractional Programming

▶Randomization

414Random Number Generators 415Randomization Techniques 416Hill-Climbing Algorithm 417Simulated Annealing

418The hanging-line method 419Finite State Machine 420Foundations of Computation Theory 421Byte Order 422Josephus Problem 423Expression Evaluation 424Scheduling Tasks on One Machine 425Majority Element Problem 426Garsia–Wachs Algorithm 42715-puzzle 428Kahan summation 429Chtholly Tree 430Introduction to Space Optimization

Introduction to Miscellaneous Topics

This section mainly introduces algorithms and OI-related knowledge that are difficult to classify.

400 Discretization

This content comes from OI Wiki: Introduction to Miscellaneous Topics. See the original for authors and revision history. AIOJ has adapted the formatting, in-site links, and resource paths.

Content is shared under CC BY-SA 4.0 and SATA license; additional terms are governed by the original notice. Thanks to the OI Wiki authors and contributors; per the SATA terms, please visit the OI Wiki repository and star it to show your support.