{"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":"东东每个学期都会去寝室接受扫楼的任务,并清点每个寝室的人数。\u003cbr/\u003e\n每个寝室里面有ai个人(1\u003c\u003di\u003c\u003dn)。从第i到第j个宿舍一共有sum(i,j)\u003da[i]+...+a[j]个人\u003cbr/\u003e\n这让宿管阿姨非常开心,并且让东东扫楼m次,每一次数第i到第j个宿舍sum(i,j)\u003cbr/\u003e\n问题是要找到sum(i1, j1) + ... + sum(im,jm)的最大值。且ix \u003c\u003d iy \u003c\u003djx和ix \u003c\u003d jy \u003c\u003djx的情况是不被允许的。也就是说m段都不能相交。\u003cbr/\u003e\n注:1 ≤ i ≤ n ≤ 1e6 , -32768 ≤ ai ≤ 32767 人数可以为负数。。。。(1\u003c\u003dn\u003c\u003d1000000)\n"}},{"title":"Input","value":{"format":"HTML","content":"输入m,输入n。后面跟着输入n个ai\n处理到 EOF"}},{"title":"Output","value":{"format":"HTML","content":"输出最大和\n"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1 3 1 2 3\n2 6 -1 4 -2 3 -2 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e6\n8\u003ci style\u003d\"font-size:1px\"\u003e \u003c/i\u003e\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cpre\u003e\n数据量很大,需要scanf读入和dp处理。\n \n \u003c/pre\u003e"}}]}