C++ Solution
\nclass Solution {\npublic:\n    int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {\n        vector<vector<int>> dp(n, vector<int>(n, 1));\n       
```\nclass Solution {\npublic:\n    int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {\n        vector<vector<int>> dp(n, vector<int>(n, 1));\n        unordered_set<int> mineSet;\n        for(auto& e: mines) mineSet.insert(e[0]*n + e[1]);\n        int ans = 0;\n        for(int j = 0; j < n; j++){ \n            for(int i = 0, cnt = 0; i < n; i++){      \n                cnt = mineSet.count(i*n+j) ? 0 : cnt + 1;\n                dp[i][j] = cnt;\n            }\n            \n            for(int i = n - 1, cnt = 0; i >= 0; i--){ \n                cnt = mineSet.count(i*n+j) ? 0 : cnt + 1;\n                dp[i][j] = min(dp[i][j], cnt);\n            }            \n        }\n        \n        for(int i = 0; i < n; i++){ \n            for(int j = 0, cnt = 0; j < n; j++){      \n                cnt = mineSet.count(i*n+j) ? 0 : cnt + 1;\n                dp[i][j] = min(dp[i][j], cnt);\n            }\n            \n            for(int j = n - 1, cnt = 0; j >= 0; j--){ \n                cnt = mineSet.count(i*n+j) ? 0 : cnt + 1;\n                dp[i][j] = min(dp[i][j], cnt);\n                ans = max(ans, dp[i][j]);\n            }            \n        }        \n        \n        return ans;\n    }\n};\n```
['C', 'C++']