[{"sectionTitle":"题目描述","type":"Text","text":"给你一个长度为 $n$ 的整数序列 $\\{A_1,A_2,\\cdots ,A_n\\}$，要求从中找出一段连续的长度不超过 $m$ 的非空子序列，使得这个序列的和最大。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"第一行为两个整数 $n,m$；\r\n\r\n第二行为 $n$ 个用空格分开的整数序列，每个数的绝对值都小于 $1000$。 ","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"仅一个整数，表示连续长度不超过 $m$ 的最大非空子序列和。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["6 4\n1 -3 5 1 -2 3","7"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于 $50\\%$ 的数据，$1\\le n,m\\le 10^4$；\r\n\r\n对于 $100\\%$ 的数据，$1\\le n,m\\le 2\\times 10^5$。\r\n","subType":"markdown"}]