最优平行轨道车皮排序问题« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2 L ，编程计算最少需要多少个平行轨道才能按...

代码说明：

最优平行轨道车皮排序问题« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2 L ，编程计算最少需要多少个平行轨道才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n的顺序输出。« 数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2 L 。-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.