用两台处理机A和B处理n个作业。设第i个作业交给机器A处理时所需要的时间是a[i]，若由机器B来处理，则所需要的时间是b[i]。现在要求每个作业只能由一台机器处理，每台机器都不能同时处理两个作业。设计一个动态规划算法，使得这两台机器处理完这n个作业的时间最短（从任何一台机器开工到最后一台机器停工的总的时间）。-Processing n jobs with two processors A and B. Time the i-th processing operations required to machine A is a [i], if processed by the machine B, the time required is b [i]. Now requires that each job can only be processed by a machine, each machine can handle both jobs. Design a dynamic programming algorithm, making these two machines finish the job processing time of these n shortest ( any machine starts to total time last machine downtime).