[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：HDU 3507\r\n\r\n给出 $N$ 个单词，每个单词有个非负权值 $C_i$，现要将它们分成连续的若干段，每段的代价为此段单词的权值和的平方，还要加一个常数 $M$，即 $(\\sum C_i)^2+M$。现在想求出一种最优方案，使得总费用之和最小。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"包含多组测试数据，对于每组测试数据： \r\n第一行包含两个整数 $N$ 和 $M$。 \r\n第二行为 $N$ 个整数。\r\n","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"输出仅一个整数，表示最小的价值。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["5 5\n5 9 5 7 5","230"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据，$0\\le N\\le 5\\times 10^5,\\ 0\\le M\\le 1000$。","subType":"markdown"}]