Now, the strategy here is pretty clear. As often is for the continuous problem. What's the strategy? I pour in the gold till I run out of gold.

现在我们的战略已经很明显了,对连续性问题战略是怎么样的？,我先把所有金子,装进去。

麻省理工公开课 - 计算机科学及编程导论课程节选

with the continuous knapsack problem as we've formulated it, greedy is good.

因为正如我们已经归越过的,对于一般连续性背包问题贪婪算法很实用。

麻省理工公开课 - 计算机科学及编程导论课程节选

Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.

至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。

麻省理工公开课 - 计算机科学及编程导论课程节选