fix: 5-3 #3

Author: JustKode

3-week3/5/JustKode.py

@@ -1,29 +1,32 @@
 import sys
-sys.setrecursionlimit(300000)
+sys.setrecursionlimit(10**9)
 
 n = int(input())
-heights = list(map(int, input().split()))
+arr = list(map(int, input().split()))
 tree = [0] * (4 * n)
 
-def init(arr, tree, node, start, end):
+def init(node, start, end):
+    global arr, tree
     if start == end:
         tree[node] = start
     else:
         mid = (start + end) // 2
-        init(arr, tree, node * 2, start, mid)
-        init(arr, tree, node * 2 + 1, mid + 1, end)
+        init(node * 2, start, mid)
+        init(node * 2 + 1, mid + 1, end)
         tree[node] = tree[node * 2] if arr[tree[node * 2]] < arr[tree[node * 2 + 1]] else tree[node * 2 + 1]
 
-def find(arr, tree, node, start, end, left, right):
+
+def find(node, start, end, left, right):
+    global arr, tree
     if left > end or right < start:
         return -1
 
     if left <= start and end <= right:
         return tree[node]
 
     mid = (start + end) // 2
-    i = find(arr, tree, node * 2, start, mid, left, right)
-    j = find(arr, tree, node * 2 + 1, mid + 1, end, left, right)
+    i = find(node * 2, start, mid, left, right)
+    j = find(node * 2 + 1, mid + 1, end, left, right)
 
     if i == -1:
         return j
@@ -32,19 +35,21 @@ def find(arr, tree, node, start, end, left, right):
     else:
         return i if arr[i] < arr[j] else j
 
-def large(arr, tree, start, end):
-    m = find(arr, tree, 1, 0, n - 1, start, end)
+
+def large(start, end):
+    global arr, tree
+    m = find(1, 0, n - 1, start, end)
     area = (end - start + 1) * arr[m]
 
     if start <= m - 1:
-        temp = large(arr, tree, start, m - 1)
+        temp = large(start, m - 1)
         area = max(area, temp)
 
     if m + 1 <= end:
-        temp = large(arr, tree, m + 1, end)
+        temp = large(m + 1, end)
         area = max(area, temp)
 
     return area
 
-init(heights, tree, 1, 0, n - 1)
-print(large(heights, tree, 0, n - 1))
+init(1, 0, n - 1)
+print(large(0, n - 1))