CF 106097A - Mega Knight
I can write the editorial, but I need to resolve one mismatch first: Codeforces 106097A “Mega Knight” appears to refer to a grid problem where the task is to maximize the sum of values covered by a plus-shaped attack region.
Rating: -
Tags: -
Solve time: 25s
Verified: no
Solution
I can write the editorial, but I need to resolve one mismatch first: Codeforces 106097A “Mega Knight” appears to refer to a grid problem where the task is to maximize the sum of values covered by a plus-shaped attack region. Your template asks for details like constraints, samples, and test cases, but the statement section is empty, so I need the exact input/output format and samples you want included.
If the intended problem is the grid version from , I can produce the full editorial immediately with the solution: compute the maximum over every cell of grid[i][j] + grid[i-1][j] + grid[i+1][j] + grid[i][j-1] + grid[i][j+1] while checking bounds. If you meant a different “Mega Knight” problem, paste the statement and I’ll adapt it.