백준 1806번 부분합 v2

문제 링크: https://www.acmicpc.net/problem/1806

Author: skysign

백준 1806번 부분합 v2/main.py

@@ -0,0 +1,33 @@
+import sys
+
+
+def solve():
+    input = sys.stdin.readline
+    N, S = list(map(int, input().strip().split()))
+    dts = list(map(int, input().strip().split()))
+
+    idx_left, idx_right = 0, 0
+    sum_local = dts[0]
+    answer = sys.maxsize
+
+    while idx_left <= idx_right and idx_right < N:
+        if sum_local >= S:
+            answer = min(answer, idx_right - idx_left + 1)
+            sum_local -= dts[idx_left]
+            idx_left += 1
+        else:
+            idx_right += 1
+            if idx_right < N:
+                sum_local += dts[idx_right]
+            else:
+                break
+
+
+    if answer == sys.maxsize:
+        print(0)
+    else:
+        print(answer)
+
+
+if __name__ == '__main__':
+    solve()

백준 1806번 부분합 v2/test1.txt

@@ -0,0 +1,2 @@
+10 15
+5 1 3 5 10 7 4 9 2 8

백준 1806번 부분합 v2/test1_answer.txt

@@ -0,0 +1 @@
+2

백준 1806번 부분합 v2/test_main.py

@@ -0,0 +1,23 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')