Description: The machine can only handle one task, so the n tasks need to be arranged in a queue for processing. When processing a task, other tasks are in a wait state, the total number of tasks waiting wait time accumulation multiplied by the task processing time. The waiting time of each task is represented by a positive integer w, which means that this task the time required for the w, When finished processing this task after the task is completed, and generates a time W-1 of the tasks, side-by-side to the end of the queue Of course, if w-1 is equal to 0, then no new task. By seeking these n tasks Ordering, it takes a minimum total waiting time is the number of
To Search:
File list (Check if you may need any files):
J.cpp
Download