CustomCC0-1.0#cp0031700
Maximum Rectangle with Bounded Zeros
Summary
- ā¢Phase 5 / 2D prefix sums, sliding window
- ā¢Reasoning-first competitive programming drill
Problem Description
Given a binary nĆm grid, find the largest area rectangle such that the number of zeros inside the rectangle is at most k.
How to read this problem in plain language:
- This is a Phase 5 reasoning drill focused on 2D prefix sums, sliding window.
- Typical lenses to test first: 2d prefix sum, rectangle, sliding window.
- Constraints reminder: 1 ā¤ n, 0 ā¤
Mini examples for mental simulation:
1) Boundary example: Describe why this case is tricky. Explain expected behavior and why naive logic may fail.
2) Adversarial example: Adversarial case where naive greedy/local decision looks correct but fails globally.
Lite-mode writing target:
- Write 1~2 observations that shrink the search space.
- Name one final algorithm and state target complexity explicitly.
- Validate with at least 2 edge cases and one hand simulation.
Constraints
- ā¢1 ā¤ n, 0 ā¤
Analysis
Key Insight
Use this hint to refine your reasoning. This step should reduce search space or formalize correctness. State why this insight changes your algorithm choice.
2d prefix sumrectanglesliding window