[SW expert Academy] SWEA 1959번 두 개의 숫자열 자바(Java)

[D2] 두 개의 숫자열 - 1959

문제 링크

성능 요약

메모리: 21,232 KB, 시간: 131 ms, 코드길이: 1,015 Bytes

제출 일자

2023-10-18 10:19

출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SW Expert Academy

import java.util.*;
import java.io.*;

class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int[] A;
        int[] B;

        int T=sc.nextInt();;
		for(int tc = 1; tc <= T; tc++)
		{
        	int N = sc.nextInt();
            int M = sc.nextInt();
            A = new int[N];
            B = new int[M];
            for(int i = 0; i < N; i++){
                A[i] = sc.nextInt();
            }
            for(int j = 0; j < M; j++){
                B[j] = sc.nextInt();
            }
            int result = searchMax(N < M ? A : B, N <= M ? B : A );
            System.out.printf("#%d %d\n",tc,result);
		}
	}
    
    private static int searchMax(int[] A, int[] B){
        int max = 0;
        for(int i = 0 ; i <= B.length- A.length; i++){
            int tmp = 0;
            for(int j = 0; j < A.length; j++){
                tmp += A[j] * B[i + j];
            }
            max = Math.max(tmp, max);
        }
        return max;
    }
}