205512026-01-07 17:49:39algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5082ms31996 KiB
# UUID: a6292836-ac14-4e2b-a517-92692b5ea6d0
n, m = [int(x) for x in input().split()]
lista = [int(x) for x in input().split()] + [0]*1
mini = n
bal = 0
jobb = 0
penz = 0
while jobb < n +1:
    if m > penz:
        penz = penz + lista[jobb]
        jobb+=1
    else:
        penz = penz - lista[bal]
        mini = min(mini,jobb-bal)
        bal+=1
print(mini)

SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/043ms19568 KiB
2Accepted0/071ms31940 KiB
3Accepted2/243ms19404 KiB
4Accepted2/239ms19608 KiB
5Accepted2/245ms19532 KiB
6Accepted2/250ms21576 KiB
7Accepted2/250ms21728 KiB
8Accepted2/259ms21624 KiB
9Accepted2/257ms21480 KiB
10Accepted2/252ms21732 KiB
11Accepted2/268ms31808 KiB
12Accepted2/281ms31980 KiB
13Accepted2/282ms31956 KiB
14Accepted2/281ms31944 KiB
15Accepted2/271ms31808 KiB
16Accepted2/268ms31908 KiB
17Accepted2/270ms31984 KiB
18Accepted2/270ms31976 KiB
19Accepted2/279ms31980 KiB
20Accepted2/279ms31796 KiB
21Accepted2/270ms31976 KiB
22Accepted2/270ms31972 KiB
23Accepted2/279ms31956 KiB
24Accepted2/276ms31932 KiB
25Accepted2/271ms31980 KiB
26Accepted2/271ms31784 KiB
27Accepted2/268ms31996 KiB