{"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":"\u003cdiv\u003e \n \u003cspan\u003e还记得上次的求最\u003cspan\u003e大连续和\u003c/span\u003e的长度\u003c/span\u003e \n \u003cspan\u003e那道题吗?(是不是so\u003c/span\u003e \n \u003cspan\u003e\u003cspan\u003eeasy?)\u003c/span\u003e\u003c/span\u003e \n \u003cspan\u003e\u003cspan\u003e这次,它爸爸出来了,想挽回DP分支家族的\u003c/span\u003e\u003c/span\u003e\n \u003cspan\u003e面子。\u003c/span\u003e\n\u003c/div\u003e \n\u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e这一次,给的\u003c/span\u003e序列不再是\u003c/span\u003e一维。\u003c/span\u003e \n \u003cspan\u003e这次,是\u003c/span\u003e矩阵,求的是最大子矩阵和。\n\u003c/div\u003e \n\u003cdiv\u003e\n 样例:\n\u003c/div\u003e \n\u003cdiv\u003e\n 0 -2 -7 0\n \u003cbr\u003e 9\u0026nbsp; 2 -6 2\n \u003cbr\u003e -4 1 -4 1\n \u003cbr\u003e -1 8 0 -2\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e \n\u003cdiv\u003e \n \u003cspan\u003e最大子矩阵和是:\u003c/span\u003e 9 + 2 + \n \u003cspan\u003e(-4)\u003c/span\u003e + 1 + \n \u003cspan\u003e(-1)\u003c/span\u003e + 8 \u003d 15\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e \n\u003cdiv\u003e\n 9 2\n \u003cbr\u003e -4 1\n \u003cbr\u003e -1 8\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e输入有多组数据。\u003c/span\u003e\u003c/p\u003e \n\u003cp\u003e \u003cspan\u003e\u003cspan\u003e每组\u003c/span\u003e\u003c/span\u003e \u003cspan\u003e输入\u003c/span\u003e \u003cspan\u003e一个N(N\u003c/span\u003e\u0026lt;\u003d\u003cspan\u003e100)\u003c/span\u003e\u003c/p\u003e \n\u003cp\u003e 接下来 N * N \u003cspan\u003e\u003cspan\u003e个整数。(\u003c/span\u003e\u003c/span\u003e range [-127,127].)\u003cbr\u003e \u0026nbsp;\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e Output the sum of the maximal sub-rectangle.\u003cbr\u003e \u0026nbsp;\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n4\r\n0 -2 -7 0 \r\n9 2 -6 2\r\n-4 1 -4 1 \r\n-1 8 0 -2\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\n15\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003e"}}]}