[Java] Java 백준 2566 최댓값

 

1. 문제

 

2. 코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.lang.StringBuilder;
import java.util.HashMap;

public class Main
{
    private BufferedReader br;
    private StringTokenizer st;
    private StringBuilder sb;
    
    private void start() throws IOException
    {
        br = new BufferedReader(new InputStreamReader(System.in));
        sb = new StringBuilder();
        
        int[][] grid = new int[9][9];
        int max = -1;
        int max_i = -1;
        int max_j = -1;
        
        // insert
        for(int i=0; i<9; i++)
        {
            st = new StringTokenizer(br.readLine());
            for(int j=0; j<9; j++)
            {
                grid[i][j] = Integer.parseInt(st.nextToken());
                
                if(max < grid[i][j])
                {
                    max = grid[i][j];
                    max_i = i+1;
                    max_j = j+1;
                }
            }
        }
        
        sb.append(max);
        sb.append("\n");
        sb.append(max_i + " " + max_j);
        
        System.out.println(sb);
        
        
    }

    public static void main(String[] args) throws IOException
    {
        new Main().start();
    }

}