04-16 13:07
Recent Posts
Recent Comments
๊ด€๋ฆฌ ๋ฉ”๋‰ด

miinsun

[Algorithm]์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ž๋ฐ”_21 ๊ฒฉ์žํŒ ์ตœ๋Œ€ํ•ฉ ๋ณธ๋ฌธ

Algorithm/Java

[Algorithm]์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ž๋ฐ”_21 ๊ฒฉ์žํŒ ์ตœ๋Œ€ํ•ฉ

miinsun 2022. 1. 3. 21:42

 

๐Ÿ’ฌ ๋ฌธ์ œ ์„ค๋ช…

5*5 ๊ฒฉ์žํŒ์— ์•„๋ž˜๋กธ ๊ฐ™์ด ์ˆซ์ž๊ฐ€ ์ ํ˜€์žˆ์Šต๋‹ˆ๋‹ค.
N*N์˜ ๊ฒฉ์žํŒ์ด ์ฃผ์–ด์ง€๋ฉด ๊ฐ ํ–‰์˜ ํ•ฉ, ๊ฐ ์—ด์˜ ํ•ฉ, ๋‘ ๋Œ€๊ฐ์„ ์˜ ํ•ฉ ์ค‘ ๊ฐ€ ์žฅ ํฐ ํ•ฉ์„ ์ถœ๋ ฅํ•ฉ๋‹ˆ๋‹ค.

 

๐Ÿ”จ ์ž…์ถœ๋ ฅ ์˜ˆ

์ž…๋ ฅ - ์ฒซ ์ค„์— ์ž์—ฐ์ˆ˜ N์ด ์ฃผ์–ด์ง„๋‹ค.(2<=N<=50)

๋‘ ๋ฒˆ์งธ ์ค„๋ถ€ํ„ฐ N์ค„์— ๊ฑธ์ณ ๊ฐ ์ค„์— N๊ฐœ์˜ ์ž์—ฐ์ˆ˜๊ฐ€ ์ฃผ์–ด์ง„๋‹ค.

๊ฐ ์ž์—ฐ์ˆ˜๋Š” 100์„ ๋„˜์ง€ ์•Š๋Š”๋‹ค.

5
10 13 10 12 15
12 39 30 23 11
11 25 50 53 15
19 27 29 37 27
19 13 30 13 19

์ถœ๋ ฅ - ์ตœ๋Œ€ํ•ฉ์„ ์ถœ๋ ฅํ•ฉ๋‹ˆ๋‹ค.

155

 

 

โ€‹

๐Ÿ’ป Solution.java

import java.util.Scanner;

public class Main {
	public int solution(int[][] arr) {
		int answer = Integer.MIN_VALUE;
		int sum1, sum2;
		
		for(int i = 0; i < arr.length; i++) {
			sum1 = sum2 = 0;
			for(int j = 0; j < arr.length; j++) {
				sum1 += arr[i][j];
				sum2 += arr[j][i];
			}
			answer = Math.max(answer, sum1);
			answer = Math.max(answer, sum2);
		}
		
		sum1 = sum2 = 0;
		for(int i = 0; i < arr.length; i++) {
			sum1 += arr[i][i];
			sum2 += arr[i][arr.length - i - 1];
		}
		answer = Math.max(answer, sum1);
		answer = Math.max(answer, sum2);
		
		return answer;
	}
	
	public static void main(String[] args){
		Main main  = new Main();
		Scanner sc =new Scanner(System.in);
		int n = 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();
			}
		}
		
		System.out.println(main.solution(arr));
		
		sc.close();
		return ;
	}
}

 

 

 

Comments