Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.

现在，当我们讨论,动态编程中的最优化问题时，我想说有两件事需要注意。

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

And when you have an optimal substructure and the local solutions overlap, that's when you can bring dynamic programming to bear.

当你得到一个最优子结构,但局部解决方案有重跌时，你就可以引入动态编程,来解决这个问题了。

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

No sooner has the speaker asked this question -- and you see this rhythm, this dynamic, appear continually throughout Lycidas - he asks the question, and then immediately he acknowledges the inadequacy of the question.

刚问完这个问题--这种节奏，这种动态是贯穿《利西达斯》始终的,-刚问完这个问题，弥尔顿又立即承认了,这个问题是不适当的。

耶鲁公开课 - 弥尔顿课程节选

So when you're trying to think about is this a problem that I can solve with dynamic programming, these are the two questions you ask.

所以当你想知道能否,用动态编程来解决这个问题时,你可以问自己两个问题。

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

That would let us tackle it with dynamic programming.

回答好这个问题我们,就能用动态编程法解决这个问题。

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