Let $$c_{1,j}$$ be the optimal solution for $$a_1$$ to $$a_j $$,

Let $$c_{1,j}$$ be the optimal solution for $$a_1$$ to $$a_j $$, and $$a_{k(j)}$$ is the nearest compatible activity to $$a_j$$ that is finished before $$a_j$$. If each activity has a weight $$w$$, then

答案：FALSE