1959. 두 개의 숫자열

1959. 두 개의 숫자열

* 문제의 저작권은 SW Expert에 있습니다 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Solution {
 
    public static void main(String[] args) throws NumberFormatException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int T = Integer.parseInt(br.readLine());
        StringTokenizer st;
        for (int test_case = 1; test_case <=T; test_case++) {
 
            int sum = 0;
            st = new StringTokenizer(br.readLine());
            int[] N = new int[Integer.parseInt(st.nextToken())];
            int[] M = new int[Integer.parseInt(st.nextToken())];
 
            st = new StringTokenizer(br.readLine());
            for (int i = 0; i < N.length; i++) {
                N[i] = Integer.parseInt(st.nextToken());
            }
 
            st = new StringTokenizer(br.readLine());
            for (int i = 0; i < M.length; i++) {
                M[i] = Integer.parseInt(st.nextToken());
            }
            int max = 0;
 
            if (M.length>N.length) {
                for (int i = 0; i < M.length-N.length+1; i++) {
                    sum = 0;
                    for (int j = 0; j < N.length; j++) {
                        sum = sum + (N[j]*M[i+j]);
                    }
                    if (sum > max) {
                        max = sum;
                    }
                }
 
            } else if (M.length<N.length) {
                for (int i = 0; i < N.length-M.length+1; i++) {
                    sum = 0;
                    for (int j = 0; j < M.length; j++) {
                        sum = sum + (M[j]*N[i+j]);
                    }
                    if (sum > max) {
                        max = sum;
                    }
                }
            }
            System.out.println("#"+test_case + " " + max);
        }
    }