백준 17829번 222-풀링 C++

https://www.acmicpc.net/problem/17829

17829번: 222-풀링

 

재귀

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int n;

vector<vector<int>> board;

int rec(int row, int col, int len) {
    if (len == 1) {
        return board[row][col];
    }
    vector<int> tmp;
    tmp.push_back(rec(row, col, len / 2));
    tmp.push_back(rec(row, col + len / 2, len / 2));
    tmp.push_back(rec(row + len / 2, col, len / 2));
    tmp.push_back(rec(row + len / 2, col + len / 2, len / 2));
    sort(tmp.begin(), tmp.end());
    return tmp[2];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    board = vector<vector<int>>(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> board[i][j];
        }
    }
    int ans = rec(0, 0, n);
    cout << ans;
}