Welcome![Sign In][Sign Up]
Location:
Downloads SourceCode Mathimatics-Numerical algorithms Data structs
Title: BOJ1293 Download
 Description: BOJ1293: colt to the fastest crossing. There are emergency water relief, not the same depth in different places, so different parts of the river, walking Speed is different. Colt the river is divided into N* M a rectangular area, like a matrix, N a north-south District, East M districts. Colt now the south bank of the river to go north to go. Colt from any neighbor Then into the river south of the region in the river, you can only go north from the current region, the Northeast, Three adjacent areas of Northwest only need to walk any of the most northern area, the next step can be more Shore. Ponies need to stay in each region the time is different. Please help pony calculations It requires at least stay in the river over a long time to cross a river.
 Downloaders recently: [More information of uploader fuxinhuang]
 To Search:
File list (Check if you may need any files):
1293小马过河.exe
1293小马过河.cpp
    

CodeBus www.codebus.net