The length l1, l2 ... ln n programs on the tape T1 and T2, and want to use the maximum search time in accordance with a minimum value of the stored, i.e., if the program stored in the set T1 and T2, respectively, A and B , you want the selected A and B such that max {Σli 1, Σli2} (i1 belongs to A, i2 belong to B) to obtain a minimum. Use backtracking implementation.

huisufa
.......\Debug
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\回溯法.exe
.......\.....\回溯法.ilk
.......\.....\回溯法.obj
.......\.....\回溯法.pch
.......\.....\回溯法.pdb
.......\回溯法.cpp
.......\回溯法.dsp
.......\回溯法.dsw
.......\回溯法.ncb
.......\回溯法.opt
.......\回溯法.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．