判断题
1.只有当局部最优跟全局最优解一致的时候，贪心法才能给出正确的解。
| T | F |
|---|
2.Let S be the set of activities in Activity Selection Problem. The greedy rule of “collecting the activity that starts the latest” is correct for finding a maximum-size subset of mutually compatible activities of S.
| T | F |
|---|
来源：CSDN
作者：葑鈊丶
链接：https://blog.csdn.net/qq_43733499/article/details/103934508