Maximum Plus
You are given a grid of (not necessarily non-negative) integers $G$ with $N$ rows and $M$ columns. Let's denote the integer in the cell $(i, j)$ of this grid by $G_{i,j}$; the rows and columns use 1-based indexing. Formally, let's call a non-empty subset of cells of the grid a *plus sign* if: - it is connected - there is a central cell $(i, j)$ which belongs to the subset - each other (non-centra
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start