AIME 2026 I · 第 11 题
AIME 2026 I — Problem 11
题目详情
Problem
The integers from to are placed in some order into an grid of cells with one number in each cell. Let be the number placed in the cell in row and column , and let be the sum of the absolute differences between adjacent cells. That is,
Find the remainder when the maximum possible value of is divided by .
解析
Solution 1
As a general intuition, we want larger numbers to be next to smaller numbers (and vice versa) to maximize this sum. The best way to do this is in a checkerboard pattern, so that all numbers in the lower half are next to higher numbers.
We then split the numbers into two sets: Small numbers and large numbers (note that all large numbers are greater than all small numbers). We wish to determine where to put these numbers to maximize the differences.
We now examine this problem from a local view: Suppose we have large numbers, and small numbers such that is surrounded by and is surrounded by . Then the sum of the differences with is .
Notice that if we swap with , the sum is which is the same. The same logic goes for if a small number is surrounded by larger numbers. Therefore, the key observation is that swapping two numbers that are surrounded by the same amount of numbers yields the same sum.
However, if is only surrounded by (as it would be if it was in an edge position), while is surrounded by , then the initial sum would be , while swapping and would yield the different sum .
As we wish to maximize the sum, we want the greater number to have a coefficient of , and therefore we want the greater extremes (e.g. 1 and 64) to be bordering four numbers, with the rest being at the edges.
With this intuition, we may see that the best arrangement is in the aforementioned checkerboard formation, with being in the corners, and being on the edges, and the rest and being in the middle.
We now calculate the sum for this which is
The requested remainder is .
~SilverRush
It isn't correct.
~metrixgo
fixed it, ty
~SilverRush
Solution 2
Like in Solution 1, make a checkerboard pattern with the numbers in the dark squares and in the light squares. Now, place on every line between adjacent squares. The absolute difference between any two adjacent squares is the sum of the difference between the first square and and the difference between and the second square. So, we can decompose our sum as
Most squares have neighbors, but squares on the edges have neighbors, and squares in the corners have . Clearly, then, we want to put the numbers closest to in the corners and edges. There are corner squares, edge squares, and squares in the middle.
Let's put in the corners, and along the edges. The remaining numbers go in the middle.
The average distance of the corner numbers from is . The average distance of the edge numbers from is . The average distance of the middle numbers from is . This gives us a total of
giving an answer of .
Video Solution
2026 AIME I #11
By piacademyus.org