{"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":"HTML","content":"给出N个单词,每个单词有个非负权值Ci,现在要将它们分成连续的若干段,每段的代价为此段单词的权值和的平方,还要加一个常数M,,即\u003cimg style\u003d\"width:31px;height:17px;\" src\u003d\"CDN_BASE_URL/deb59af46e26501d1335903fa890b00f?v\u003d1564950586\" SRC\u003d\"CDN_BASE_URL/deb59af46e26501d1335903fa890b00f?v\u003d1564950586\"\u003e。现在想求出一种最优方案,使得总费用之和最小。"}},{"title":"输入格式","value":{"format":"HTML","content":"包含多组测试数据,对于每组测试数据。\n第一行包含两个整数N和M(0\u003c\u003dN\u003c\u003d500000,0\u003c\u003dM\u003c\u003d1000)。\n第2-N+1行为N个整数C[i]。"}},{"title":"输出格式","value":{"format":"HTML","content":"输出仅一个整数,表示最小的价值。"}},{"title":"样例输入","value":{"format":"HTML","content":"\u003cpre\u003e5 5\n5\n9\n5\n7\n5\n3 0\n1\n2\n3\u003c/pre\u003e"}},{"title":"样例输出","value":{"format":"HTML","content":"\u003cpre\u003e230\n14\u003c/pre\u003e"}},{"title":"","value":{"format":"HTML","content":""}}]}