[SWEA] 2001. 파리 퇴치_JAVA

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq 

SW Expert Academy

 

 

 

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Solution {
    static int  n, m;
    static int[][] area;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int T = Integer.parseInt(br.readLine());
        for(int tc=1; tc<=T; tc++) {
            StringTokenizer st = new StringTokenizer(br.readLine()," ");
            n = Integer.parseInt(st.nextToken());
            m = Integer.parseInt(st.nextToken());
            area = new int[n][n];
            for(int i=0; i<n; i++) {
                st = new StringTokenizer(br.readLine()," ");
                for(int j=0; j<n; j++) {
                    area[i][j] = Integer.parseInt(st.nextToken());
                }
            }
            int sum = 0;
          
            for(int i=0; i<=n-m; i++) {
                for(int j=0; j<=n-m; j++) {
                    sum=Math.max(sum,cal(i,j));
                }
            }
            System.out.println("#"+tc+" "+sum);
        }
    }
     
    static int cal(int x, int y) {
        int tmp = 0;
        for(int i=x; i<x+m; i++) {
            for(int j=y; j<y+m; j++) {
                tmp += area[i][j];
            }
        }
        return tmp;
    }
 
}