Description: Driving automobile fuel problem (Exercise 3-16)
Problem description:
Given an N* N square grid, set the upper left corner as a starting point, coordinates (1,1), X-axis to the right is positive, Y axis under
Positive side of each square is 1. A car starting from the starting point towards the lower right corner of the end, the coordinates (N, N).
In a number of grid intersection points, set the oil tanks, fuel for the car is moving his way. Car in motion the process to be observed, such as
The following rules:
(1) The car can only travel along the grid edge, full of oil can travel the grid section K edge. Starting when the car was filled with oil, in the beginning and the end
No point depot.
(2) When the vehicle driving through a mesh edge, if the X coordinate or Y coordinate decreases, the fees payable B, or toll-free
Use.
(3) vehicles in the process of moving the event should fill up and pay for fuel oil storage costs A.
(4) when required grid points in the addi
To Search:
- [travSrcCVar] - vehicle refueling will issue the restric
- [CAR] - ACM Algorithm Analysis Topic: automotive
- [rent] - Yacht rental issues in the Yangtze River
- [suanfa3_1] - Some classic algorithms: including light
- [3.2] - With n different coins, the face value o
- [coin] - failed to translate
File list (Check if you may need any files):
min
...\1.cpp
...\1.exe
...\input.txt
Download