{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027],[\u0027\\[\u0027,\u0027\\]\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027description-container\u0027]);}, 2000);\u003c/script\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_s3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_s3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_s3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_s3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n N堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n \u003cbr\u003e\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n 例如: 1 2 3 4,有不少合并方法\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n 1 2 3 4 \u003d\u0026gt; 3 3 4(3) \u003d\u0026gt; 6 4(9) \u003d\u0026gt; 10(19)\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n 1 2 3 4 \u003d\u0026gt; 1 5 4(5) \u003d\u0026gt; 1 9(14) \u003d\u0026gt; 10(24)\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n 1 2 3 4 \u003d\u0026gt; 1 2 7(7) \u003d\u0026gt; 3 7(10) \u003d\u0026gt; 10(20)\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n \u003cbr\u003e\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n 括号里面为总代价可以看出,第一种方法的代价最低,现在给出n堆石子的数量,计算最小合并代价。\n\u003c/div\u003e\n\u003cdiv id\u003d\"Showjim30_bjbgbsbbbnbf\"\u003e\n \u003cspan id\u003d\"Showjim2_bnbbbsbl_s3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n \u003cspan id\u003d\"Showjim2_bnbbbsbl_e3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003c/div\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_e3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_e3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_e3\" style\u003d\"display:none\"\u003e\u003c/span\u003e\n\u003cspan id\u003d\"Showjim2_bnbbbsbl_e3\" style\u003d\"display:none\"\u003e\u003c/span\u003e"}},{"title":"Input","value":{"format":"MD","content":"第1行:N(2 \u0026lt;\u003d N \u0026lt;\u003d 100)\n\u003cbr\u003e第2 - N + 1:N堆石子的数量(1 \u0026lt;\u003d A[i] \u0026lt;\u003d 10000)"}},{"title":"Output","value":{"format":"MD","content":"输出最小合并代价"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e4\n1\n2\n3\n4\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003e19\u003c/pre\u003e"}}]}