Description: optimal parallel tracks wagon laquo scheduling problem; Programming tasks : Given a positive integer n, and n cars of the initial numbers n a, a,, a 1 2 L, programming calculations need at least the number of parallel tracks can be in accordance with the rules (1) and (2) Scheduling wagon, the wagon wagon with exports 1,2, ..., n output in the order. Laquo; Data input : from the document input.txt given input data. The first line is a positive integer n, n said a wagon. Line 2 n wagon is the initial numbers n a, a,, a 1 2 L.
To Search:
File list (Check if you may need any files):
Download