文件名称:shibingzhandui
介绍说明--下载内容均来自于网络,请自行研究使用
在一个划分成网格的操场上,n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步,但在同一时刻任一网格点上只能有一名士兵。按照军官的命令,士兵们要整齐地列成一个水平队列,即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x和y的值才能使士兵们以最少的总移动步数排成一列。
-In a grid divided into the playground, n soldiers stood scattered points on the grid. Grid point by the integer coordinates (x, y), said. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any point on the grid can only be a soldier. In accordance with the orders of officers, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+1, y), ..., (x+ n-1, y). How to choose the value of x and y in order to enable the soldiers to a total of at least moves one line up.
-In a grid divided into the playground, n soldiers stood scattered points on the grid. Grid point by the integer coordinates (x, y), said. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any point on the grid can only be a soldier. In accordance with the orders of officers, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+1, y), ..., (x+ n-1, y). How to choose the value of x and y in order to enable the soldiers to a total of at least moves one line up.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
shibingzhandui.txt