Description: (1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.
To Search:
File list (Check if you may need any files):
shuanfa3\test\Debug\test.exe
........\....\.....\test.ilk
........\....\.....\test.obj
........\....\.....\test.pch
........\....\.....\test.pdb
........\....\.....\vc60.idb
........\....\.....\vc60.pdb
........\....\test.cpp
........\....\test.dsp
........\....\test.dsw
........\....\test.ncb
........\....\test.opt
........\....\test.plg
........\....\Debug
........\test
shuanfa3
Download