205502026-01-07 17:49:31algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5085ms31984 KiB
# UUID: cc22518c-e409-4a7f-8e96-cb4d52fb9148
n, m = [int(x) for x in input().split()]
lista = [int(x) for x in input().split()] + [0]*1
#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/045ms19528 KiB
2Accepted0/071ms31780 KiB
3Accepted2/243ms19588 KiB
4Accepted2/239ms19400 KiB
5Accepted2/245ms19528 KiB
6Accepted2/250ms21524 KiB
7Accepted2/257ms21668 KiB
8Accepted2/252ms21520 KiB
9Accepted2/257ms21540 KiB
10Accepted2/252ms21732 KiB
11Accepted2/268ms31964 KiB
12Accepted2/285ms31852 KiB
13Accepted2/271ms31952 KiB
14Accepted2/279ms31972 KiB
15Accepted2/270ms31980 KiB
16Accepted2/281ms31980 KiB
17Accepted2/279ms31844 KiB
18Accepted2/270ms31868 KiB
19Accepted2/271ms31796 KiB
20Accepted2/283ms31980 KiB
21Accepted2/279ms31880 KiB
22Accepted2/268ms31840 KiB
23Accepted2/270ms31888 KiB
24Accepted2/279ms31984 KiB
25Accepted2/271ms31788 KiB
26Accepted2/278ms31816 KiB
27Accepted2/268ms31788 KiB