{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"你有n个数s1, s2...sn,给你一个整数m,求m个子段和的最大值\n"}},{"title":"Input","value":{"format":"MD","content":"输入m,输入n。后面跟着输入n个ai \n\n(n \u003c 1e6)"}},{"title":"Output","value":{"format":"MD","content":"输出最大和\n"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e1 3 1 2 3\n2 6 -1 4 -2 3 -2 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003e6\n8\n\n\n \n \u003ci style\u003d\"font-size:1px\"\u003e \u003c/i\u003e\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"MD","content":"\u003cpre\u003e\nHuge input, scanf and dynamic programming is recommended.\n注意:本题可以使用$O(nm)$的时间复杂度。\n\n \n \u003c/pre\u003e"}}]}