report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
Module Introduction to meet in the middle

Introduction to meet in the middle

**Frequency: 1/10** This technique divides the search space into two. This technique can improve naive backtracking, help to solve problems with higher constraint (for example $n=40$ instead of $20$). May appear as a subtask in OI style contest.

Resources

- [USACO Guide: Meet in the middle](https://usaco.guide/gold/meet-in-the-middle)

Problems

Subset sum 2 514 / 619 800
Sum of four values 355 / 406 800
Robot 278 / 300 900
Minimum difference 271 / 332 900
Maximum sum subset 239 / 272 1000
Stealing books 229 / 247 1000

Binary search

  • Introduction to Binary Search
  • Binary search on answer

Two pointers

  • Introduction to two pointers

Math

  • Basic number theory
  • Binary exponentiation

Meet in the middle

  • Introduction to meet in the middle

STL

  • Containers C++ in Standard Template Library (STL)