Update 2250

hehehwang · hehehwang · commit 502d223ceb79 · 2022-09-04T18:26:33.000+09:00
diff --git a/0x19/solutions/2250.cpp b/0x19/solutions/2250.cpp
@@ -1,11 +1,52 @@
-// Authored by : BaaaaaaaaaaarkingDog
+// Authored by : heheHwang
 // Co-authored by : -
-// http://boj.kr/****************
+// http://boj.kr/d6c7ee9ea1a64b95885c8858ddbf1404
 #include <bits/stdc++.h>
 using namespace std;
 
-int main(void){
+const int MXN = 10010;
+int lc[MXN], rc[MXN], N, colno, root;
+pair<int, int> depth[MXN];
+void inorder(int curr, int d) {
+  if (curr == -1) return;
+  inorder(lc[curr], d + 1);
+  colno++;
+  if (!depth[d].first || colno < depth[d].first)
+    depth[d].first = colno;
+  if (!depth[d].second || depth[d].second < colno)
+    depth[d].second = colno;
+  inorder(rc[curr], d + 1);
+}
+int main(void) {
   ios::sync_with_stdio(0);
   cin.tie(0);
-  
+
+  cin >> N;
+  vector<bool> isRoot(N + 1, true);
+  for (int i = 0; i < N; i++) {
+    int p, l, r;
+    cin >> p >> l >> r;
+    lc[p] = l;
+    rc[p] = r;
+
+    if (l != -1) isRoot[l] = false;
+    if (r != -1) isRoot[r] = false;
+  }
+  for (int i = 1; i <= N; i++)
+    if (isRoot[i]) {
+      root = i;
+      break;
+    }
+  int mxWidth = 0, mxDepth = 0;
+  inorder(root, 0);
+  for (int d = 0; d < N; d++) {
+    auto [l, r] = depth[d];
+    if (l + r == 0) break;
+    int width = r - l + 1;
+    if (mxWidth < width) {
+      mxWidth = width;
+      mxDepth = d;
+    }
+  }
+  cout << mxDepth + 1 << ' ' << mxWidth;
 }
