[SWEA] 2001. 파리 퇴치

 2001. 파리 퇴치

swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV5PzOCKAigDFAUq&categoryId=AV5PzOCKAigDFAUq&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

// 210130
// 2001. 파리 퇴치
public class SWEA2001 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int T = sc.nextInt();

		for (int tc = 1; tc <= T; tc++) {
			int N = sc.nextInt();
			int M = sc.nextInt();
			int[][] arr = new int[N][N];

			// 입력
			for (int i = 0; i < N; i++) {
				for (int j = 0; j < N; j++) {
					arr[i][j] = sc.nextInt();
				}
			}

			int max = 0;
			for (int i = 0; i <= (N - M); i++) {
				for (int j = 0; j <= (N - M); j++) {
					int sum = 0;
					for (int z=0; z<M; z++) {
						for (int w=0; w<M; w++) {
							sum += arr[i+z][j+w];
						}
					}
					if (sum > max) max = sum;
				}
			}
			System.out.println("#" + tc + " " + max);
		} // for

		sc.close();
	} // main
}