Jump to the question with one click Question description There are $n$ tasks that need to be processed on the machine, and they form a sequence. The tasks are numbered $1$ to $n$, so the sequence is arranged as $1, 2, 3 \cdots n$. These $n$ tasks are divided into several batches, and each batch contains several adjacent tasks. Starting from time $0$, these tasks are processed in batches, and the time required to complete the ii-th task alone is $T_i$. Before each batch of tasks starts, the machine needs to start up time $s$, and the time required to complete this batch of tasks is the sum of the time required for each task. Note that the same batch of tasks will be completed at the same time. The cost of each task is its completion time multiplied by a fee