{"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堆石子围成一个圆型,每堆石子数量分别为a1,a2....an(从a1到an围成一圈,an与a1相邻)现在要将这n堆石子合并成一堆,每次只能合并相邻的两堆,每次合并的得分是这两堆石子的数量之和,计算这n堆石子合并成一堆的最小得分。"}},{"title":"Input","value":{"format":"HTML","content":"多组输入\u003c/br\u003e\n每组数据第一行输入n . 1\u003c\u003dn\u003c\u003d1000 \u003c/br\u003e\n第二行输入n个正整数 a1到an,代表每堆石子的数量。 ai\u003c\u003d1000"}},{"title":"Output","value":{"format":"HTML","content":"每组数据输出最小得分"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\n3\n1 2 3\n8\n5 2 4 7 6 1 3 9\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\n9\n105\n\u003c/pre\u003e"}},{"title":"说明","value":{"format":"HTML","content":"第一组样例 最优策略是:先合并 1和2,得分是3,然后还剩两堆石子,数量分别为 3,3.然后合并这两堆,得分为6. 两次合并总分是9"}}]}