{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftatsumi83.hatenadiary.org%2Fentry%2F20101206%2F1291591797\" title=\" Maximum Sum Subsequence - \u767e\u5149\u5e74\u30d4\u30af\u30cb\u30c3\u30af\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","author_name":"tatsumi83","height":"190","title":" Maximum Sum Subsequence","categories":["Scheme","Programming Praxis"],"provider_url":"https://hatena.blog","url":"https://tatsumi83.hatenadiary.org/entry/20101206/1291591797","published":"2010-12-06 08:29:57","version":"1.0","author_url":"https://blog.hatena.ne.jp/tatsumi83/","description":"Programming Praxis | A collection of etudes, updated weekly, for the education and enjoyment of the savvy programmer\u3068\u3044\u3046\u30b5\u30a4\u30c8\u306bMaximum Sum Subsequence | Programming Praxis\u3068\u3044\u3046\u554f\u984c\u304c\u3042\u3063\u305f\u306e\u3067\u89e3\u3044\u3066\u307f\u307e\u3057\u305f\u3002 cont-max2\u306f\u307b\u307c\u30b5\u30a4\u30c8\u306b\u8f09\u3063\u3066\u3044\u305f\u6a21\u7bc4\u89e3\u7b54\u306e\u6700\u5f8c\u306e\u3084\u3064\uff08O(n)\u306e\u89e3\u7b54\uff09\u3068\u540c\u3058\u3067\u3057\u305f\u3002\u305fcont-max\u306f\u6700\u5927\u5024\u306b\u52a0\u3048\u3066\u3001\u6700\u5927\u306b\u306a\u308b\u90e8\u5206\u6570\u5217\u3082\u51fa\u529b\u3057\u307e\u3059\u3002 \u6570\u5217\u3092\u524d\u304b\u3089\u9806\u756a\u306b\u898b\u3066\u3044\u3063\u3066\u3001\u305d\u306e\u6642\u70b9\u3067\u306e\u6700\u5927\u5024\u3068\u3001\u4e00\u3064\u524d\u306e\u6570\u2026","blog_url":"https://tatsumi83.hatenadiary.org/","blog_title":"\u767e\u5149\u5e74\u30d4\u30af\u30cb\u30c3\u30af","type":"rich","width":"100%","image_url":null}