To prove the correctness of a greedy algorithm, we must prove th
To prove the correctness of a greedy algorithm, we must prove that an optimal solution to the original problem always makes the greedy choice, so that the greedy choice is always safe. 答案：FALSE
