Description: In a grid divided into the playground, n soldiers stood scattered on the grid points. Grid point by the integer coordinates (x, y) express. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any one grid point has only one soldier. In accordance with the officer s command, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+ 1, y), ..., (x+ N-1, y). How to choose x and y values to make the soldiers with the minimum of the total moves one line up. Experimental tasks: the calculation so that all the soldiers lined up his required minimum moves.
- [Drawing] - Windows MFC Programming, MFC drawing fun
- [rent] - Yacht rental issues in the Yangtze River
- [soldier] - In a grid divided into the playground, n
- [C++Primer] - C++ Primer Fourth Edition, CD-ROM Source
- [TextShadePrj] - This is a small VC preparation procedure
- [guandao.cpp] - An oil company plans to construct a east
- [zhongweishu.cpp] - X [0: n-1] and Y [0: n-1] for the two ar
- [tessellation] - Grid [tessellation] that is concave poly
File list (Check if you may need any files):
Download