[Week04] BOJ 14925: 목장 건설하기

Author: whqtker

weekly/week3/BOJ_1477_휴게소 세우기/whqtker.cpp weekly/week03/BOJ_1477_휴게소세우기/whqtker.cppweekly/week3/BOJ_1477_휴게소 세우기/whqtker.cpp renamed to weekly/week03/BOJ_1477_휴게소세우기/whqtker.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int dp[1001][1001];
+
+int main() {
+	int n, m;
+	cin >> n >> m;
+
+	int ans = 0;
+	for (int i = 1; i <= n; i++) {
+		for (int j = 1; j <= m; j++) {
+			int x;
+			cin >> x;
+
+			if (x == 0) {
+				dp[i][j] = min({ dp[i - 1][j - 1],dp[i - 1][j],dp[i][j - 1] }) + 1;
+				ans = max(ans, dp[i][j]);
+			}
+		}
+	}
+
+	cout << ans;
+}