205492026-01-07 17:49:17algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5082ms31980 KiB
# UUID: c0f9a7b0-1e95-4518-9b3d-298a48cf1e1c
n, m = [int(x) for x in input().split()]
lista = [int(x) for x in input().split()] + [0]
#lista.sort()
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/043ms19536 KiB
2Accepted0/081ms31952 KiB
3Accepted2/239ms19388 KiB
4Accepted2/239ms19396 KiB
5Accepted2/245ms19612 KiB
6Accepted2/257ms21540 KiB
7Accepted2/252ms21732 KiB
8Accepted2/259ms21572 KiB
9Accepted2/257ms21480 KiB
10Accepted2/252ms21644 KiB
11Accepted2/270ms31876 KiB
12Accepted2/282ms31884 KiB
13Accepted2/271ms31980 KiB
14Accepted2/279ms31976 KiB
15Accepted2/271ms31956 KiB
16Accepted2/281ms31980 KiB
17Accepted2/270ms31888 KiB
18Accepted2/268ms31976 KiB
19Accepted2/279ms31976 KiB
20Accepted2/282ms31980 KiB
21Accepted2/268ms31976 KiB
22Accepted2/268ms31980 KiB
23Accepted2/281ms31928 KiB
24Accepted2/270ms31860 KiB
25Accepted2/270ms31820 KiB
26Accepted2/278ms31900 KiB
27Accepted2/279ms31980 KiB