View Code of Problem 3569

#include<stdio.h>
void main()
{
	int s[100][100],n = 0,m,t,temp,i,j,k;
	scanf("%d",&t);           
    while(n < t)
	{
		scanf("%d",&m);       
		for(i=1;i<=n;i++)
			s[i][0]=0;
		for(i = 1;i <= m;i ++)
			for(j = 1;j <= m;j ++)
			{
				scanf("%d",&temp);
				s[i][j] = s[i][j - 1] + temp;                  
			}
		int max = -100000;
		for(i = 1;i <= m;i ++)              
			for(j = 1;j <= m;j ++)            
			{
				int sum = 0;
				for(k = 1;k <= m;k ++)
				{
					if(sum < 0)
						sum = 0;
					sum += s[k][j] - s[k][i-1];               
					if(sum > max)
						max = sum;                 
				}
			}
		 printf("%d\n",max);
		 n ++;
	}
}