Description: Given a square grid of N* N, the top left corner is the starting point, the coordinate is (1, 1), and the X-axis is positive, Y
The axis is positive, and the sides of each square are 1. A car starts from the starting point and ends at the bottom right corner, with the coordinates of (N,
N). At several grid intersections, the oil depot is set up to fuel the car during the drive. The car is on the road
The following rules should be observed:
(1) the car can only travel along the edge of the grid, and can be filled with oil to drive the edge of the K grid. The car was full of oil when it started
No oil depot at the beginning and end points.
(2) when the car passes a grid, if its X coordinates or Y coordinates are reduced, then the cost is payable B, otherwise
Free of charge.
(3) when the car is running, the oil tank should be filled with oil and the cost of refueling is A.
(4) add an oil depot at the grid point when needed, and pay for additional oil depot (excluding refueling costs A).
(5) (1) ~ (4) N, K, A, B and C are positive integers.
- [ex] - Optimal scheduling problem, assuming tha
- [bstringk] - 01 discrete string problem ?Description
- [algorithmbookandanswer] - Algorithm design and analysis of the thi
File list (Check if you may need any files):
Download