{"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\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, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n Acmer同学接到了一个任务,有一个m×n的整数矩阵,要在上面在上面找一个 x × y 的子矩阵,使该子矩阵中所有元素的和为所有 x × y 的子矩阵中最大的。 \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"输入数据的第一行为一个正整数T,表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y(0\u0026lt;m,n\u0026lt;1000 , 0\u0026lt;x\u0026lt;\u003dm , 0\u0026lt;y\u0026lt;\u003dn),表示给定的矩形有m行n列。接下来这个矩阵,有m行,每行有n个不大于1000的正整数。"}},{"title":"Output","value":{"format":"HTML","content":"对于每组数据,输出一个整数,表示子矩阵的元素之和。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1\n4 5 2 2\n3 361 649 676 588\n992 762 156 993 169\n662 34 638 89 543\n525 165 254 809 280\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2474\u003c/pre\u003e"}}]}