TreeviewCopyright © aleen42 all right reserved, powered by aleen42

Max Sum Problem(最大和) Back


  • 求出某一段最大和
  • : 以第j個結尾的最大和的值.

Optimal Substructure

  • 當我們求時, 若的值為非正, 則肯定沒意義; 若的值為正, 且為非正, 則肯定為; 而若的值為正, 且也為正, 則肯定為加上.

Recursive Expression


  • 最優解: 通過求解時指針指向i和j來找到最優解.
  • 最優解的值:
Empty Comments
Sign in GitHub

As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.

Notice: This plugin has used Cookie to store your token with an expiration.