🐄 Binary Search on Answer — Aggressive Cows
USACO C++ Book · Interactive Visualizer
🐄 Binary Search on Answer — Maximize Minimum Distance (C=3 cows)
Binary Search on Answer
Greedy Check O(N)
Step 0/12
📊 Stalls: [1, 2, 4, 8, 9] — Place 3 cows, maximize min gap
🗂 Current State
Binary Search Range
canPlace(mid) Check
Answer So Far
canPlace:
O(N)
per call
Binary search:
O(log D)
iters
Total:
O(N log D)
💻 Code
Tip
Click
Next Step ▶
to begin. Watch binary search narrow the answer range while greedy check verifies each candidate.
◀ Prev
Next Step ▶
↺ Reset
0/12
Keyboard:
→
Next
←
Prev
R
Reset