列车调度问题（Train scheduling problem）.docVIP

列车调度问题（Train scheduling problem） Train scheduling problem (2010-01-04, 21:38:32) We reprint Label： The classification technology garden (stars) Zi Yuan summer with my mom and dad went back to his hometown in Hunan, the home is located in a hilly area of South Hunan Hill package, the traffic is very inconvenient, starting from Ningbo to sit twenty-four hours by train, sit more than three hours of the car, finally walk two hours to get home. In the train station waiting for the time, just to see the window outside the V shaped platform, see Zi Yuan curiously staring at the platform to see, Dad had an idea. Son, dad has a question about the train schedule. I dont know if youre interested Train scheduling? Do you mean the kind of train were going to take today? Yes, the railway for train dispatching, the platform designed to stack structure of V shaped platform, like the kind of outside (shown at right). Well, now let me examine you: ! --[if! Vml]--! --[endif]-- (1) are numbered 1, 2, 3, 4 of the four trains, the order into the stack structure of the platform, may the stack sequence how many? If n train? (2) if the order of the four trains in the station is as mentioned above, can you get 142324133412 and 4312?. The outbound sequence? Why? Http:/// Zi Yuan took out the pen and paper from the bag and counted it. A moment later, the paper was covered with thickly dotted answers: Possible stack sequences: 12341243132413421432213421432314234124313214324134214321. The impossible stack sequence: 1423241331243142341241234132421342314312. If it is a n train, how many possible stack sequences will be possible? It is necessary to calculate the possible sequence number of the n when the smaller value is taken, and observe whether there is a rule. The number of possible stack sequences for a n train is F (n): F (1) = 1; F (2) = 2; F (3) = 5; F (4) = 14; Zi Yuan seemed unable to find the rules and had to do it. Lets see why sequences such as 142324133412 and 4312 are out of the ques