2024-03-22

tgyuuAn/README.md

@@ -44,4 +44,5 @@
 | 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
 | 41차시 | 2023.03.04 |  DP  | <a href="https://www.acmicpc.net/problem/2240">자두나무</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/148
 | 42차시 | 2023.03.07 |  DFS  | <a href="https://www.acmicpc.net/problem/2239">스도쿠</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/152
+| 47차시 | 2023.03.22 |  수학, 분할정복  | <a href="https://www.acmicpc.net/problem/15824">너 봄에는 캡사이신이 맛있단다</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/167
 ---

tgyuuAn/수학/너 봄에는 캡사이신이 맛있단다.py

@@ -0,0 +1,33 @@
+import sys
+
+DIV = 1_000_000_007
+
+def input(): return sys.stdin.readline().rstrip()
+
+def power(n, over):
+    if over == 0: return 1
+    elif over == 1: return n
+    elif over %2 == 0: 
+        half = (power(n, over//2) % DIV)
+        return (half * half) % DIV
+    else: 
+        half = (power(n, over//2) % DIV)
+        return (half * half * (n % DIV)) % DIV
+
+N = int(input())
+numbers = sorted(list(map(int,input().split())))
+DP = [-1 for _ in range(N)]
+answer = 0
+
+for start_idx in range(N):
+    start_num = numbers[start_idx]
+    end_num = numbers[N-start_idx-1]
+
+    # 만약 캐싱이 되어있지 않을 경우 직접 계산
+    if DP[N-start_idx-1] == -1: DP[N-start_idx-1] = power(2, N-start_idx-1)
+
+    # 한번이라도 계산  했으면 바로 이용
+    answer += ((end_num % DIV) * (DP[N-start_idx-1] % DIV)) % DIV
+    answer -= ((start_num % DIV) * (DP[N-start_idx-1] % DIV)) % DIV
+
+print(answer % DIV)