把长度为l1,l2…ln 的n个程序放在磁带T1和T2上，并且希望按照使用最大检索时间取得最小值的方式存储，即如果存放在T1和T2上的程序集合分别为A和B，则希望所选择的A和B使得max{∑li 1,∑li2}(i1属于A，i2属于B)取得最小。

使用回溯法实现。-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.