Description: Ex3.6 wagon sequence problem. Problem description : In a train station, a connecting track to a side track, the formation of a railway transition stack, as shown in Fig. Which left orbit for imported cars, the right orbit for export, numbered 1, 2, ..., n n cars were imported from the stack into the transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order re-sequence a1, a2,. , An . . Programming tasks : Given a positive integer n, the left orbital calculation programming wagon followed by No. 1, 2, ..., n, on the right track can get at the maximum number of different cars sequence program. For example, when n = 3, a maximum of five different sequence of the program are as follows : 1 2 3 1 3 2 2 1 3 2 3 1 3 2 1. Data inp
To Search:
- [列车调度问题] - sfsf zsfzs
- [railk] - wagon optimal scheduling problem. Proble
- [socketip] - card installed for the use of Chaos mode
- [C6201EVMsch] - TI DSPTMS3206201 Evaluation development
- [24_problem] - program design classic, 24 points, VC so
- [Qx1] - AutoCAD drawing railway route map design
- [stacks] - In a train dispatching station, one trac
File list (Check if you may need any files):
Download