30-yuna83

yuna83/README.md

@@ -30,4 +30,6 @@
 | 26차시 | 2024.01.30 |  딕셔너리  | [귤 고르기](https://school.programmers.co.kr/learn/courses/30/lessons/138476)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/125|
 | 27차시 | 2024.02.05 |  투포인터  | [좋다](https://www.acmicpc.net/problem/1253)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/129|
 | 28차시 | 2024.02.07 |  투포인터  | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/134|
+| 29차시 | 2024.02.13 |  슬라이딩윈도우  | [블로그](https://www.acmicpc.net/problem/21921)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/136|
+| 29차시 | 2024.02.19 |  슬라이딩윈도우  | [도둑](https://www.acmicpc.net/problem/13422)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/141|
 ---

yuna83/슬라이딩윈도우/도둑.py

@@ -0,0 +1,27 @@
+import sys
+input=sys.stdin.readline
+
+t=int(input())
+for i in range(t):
+    n,m,k=map(int,input().split())
+    home=list(map(int,input().split()))
+
+    if m!=n:
+        for j in range(m-1):
+            home.append(home[j])
+
+    start= 0
+    end=m-1
+    count=sum(home[:m])
+    answer=0
+
+    if count<k: # 시작 윈도우 확인
+        answer+=1
+    while end<len(home)-1:
+        count-=home[start]
+        start+=1
+        end+=1
+        count+=home[end]
+        if count<k:
+            answer+=1
+    print(answer)