![[C++] 백준 7단계 - 2566번 문제 (최댓값)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbHnDEA%2FbtsaVdCcD42%2FAAAAAAAAAAAAAAAAAAAAADNy755c-rB-Aga3F64sD6NdWrBbsrI4HNjseBK8V5_V%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1761922799%26allow_ip%3D%26allow_referer%3D%26signature%3D8JTLbfqORIaEbQDJk0GFKk0rW0w%253D)
[C++] 백준 7단계 - 2566번 문제 (최댓값)자료구조 & 알고리즘/BOJ2023. 4. 18. 16:20
      Table of Contents
        문제설명


소스코드
#include <iostream>
using namespace std;
int main() {
	int arr[9][9];
	int input; int max = -1; int x; int y;
	for (int i = 0; i < 9; ++i)
	{
		for (int j = 0; j < 9; ++j)
		{
			cin >> input;
			arr[i][j] = input;
			if (arr[i][j] > max)
			{
				max = arr[i][j];
				x = i; y = j;
			}
		}
	}
	cout << max << endl;
	cout << x + 1 << " " << y + 1;
}
풀이
- 2차원 배열(9x9행렬)을 생성한다.
- 배열의 값을 입력받으면서 배열의 값이 초기에 -1로 설정된 max보다 크면 max에는 배열의 값이 들어간다.
- max보다 배열의 값이 크면 for문의 지역변수인 i와 j를 x와 y에 대입한다.
- max를 출력하고 x+1, y+1값을 출력한다.(배열은 idx가 0부터 시작하기 때문)
'자료구조 & 알고리즘 > BOJ' 카테고리의 다른 글
| [C++] 백준 7단계 - 2563번 문제 (색종이) (0) | 2023.04.20 | 
|---|---|
| [C++] 백준 7단계 - 10798번 문제 (세로읽기) (0) | 2023.04.18 | 
| [C++] 백준 7단계 - 2738번 문제 (행렬 덧셈) (0) | 2023.04.17 | 
| [C++] 백준 6단계 - 25206번 문제 (너의 평점은) (0) | 2023.04.17 | 
| [C++] 백준 6단계 - 1316번 문제 (그룹 단어 체커) (0) | 2023.04.16 | 
![[C++] 백준 7단계 - 2563번 문제 (색종이)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcdQNkS%2FbtsbDF4UWCu%2FAAAAAAAAAAAAAAAAAAAAAIdwFS-_brnISkIUJiTGt_8bKMQjsDbewNX9yQHOQ8Sa%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1761922799%26allow_ip%3D%26allow_referer%3D%26signature%3DT9nyIUYfLhLR3r9ZYWvrL3QvBPI%253D) 
                  ![[C++] 백준 7단계 - 10798번 문제 (세로읽기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Febs3NM%2Fbtsa9Kypb0A%2FAAAAAAAAAAAAAAAAAAAAADEMNdgBMUEi65vW2CFiuayfqnk-w1VwOiMH_fP9zAFh%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1761922799%26allow_ip%3D%26allow_referer%3D%26signature%3DDZZBFCEcw13Bngz1pMajtVLbkDg%253D) 
                  ![[C++] 백준 7단계 - 2738번 문제 (행렬 덧셈)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2F1cEj0%2FbtsayU4Fc5b%2FAAAAAAAAAAAAAAAAAAAAAEBn03Pj_51SIp7x7Zt83sfqym_POCZtsNAt2PMYqHHX%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1761922799%26allow_ip%3D%26allow_referer%3D%26signature%3DasCz0%252FENFjrYfkuzMuH2hAlG59Y%253D) 
                  ![[C++] 백준 6단계 - 25206번 문제 (너의 평점은)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fw0Qg9%2FbtsaKx8ef97%2FAAAAAAAAAAAAAAAAAAAAADE85QBbHdKBQB2Nb3PSERZJxjC4qzfYj-JKzhOwLU2P%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1761922799%26allow_ip%3D%26allow_referer%3D%26signature%3Dcl%252FvNXcxhRZ8KY8qq4qTt0QnNEQ%253D)