202572026-01-05 17:58:54algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5082ms31980 KiB
# UUID: 438e5629-ff28-4fb9-9c5e-e1328f88bd87
nap, penzkell = [int(x) for x in input().split()]
penzek = [int(x) for x in input().split()]
legkevesebbnap = nap
i = 0
j = 1
#mostnap = 0
mostpenz = penzek[i]
while i < nap and j < nap:
    
    if mostpenz + penzek[j] < penzkell:
        mostpenz += penzek[j]
        #mostnap = j-i+1
        j += 1
    else: 
        mostpenz -= penzek[i]
        #mostnap = j-i+1
        legkevesebbnap = min(legkevesebbnap, j-i+1)
        i += 1
    #print(mostnap)
print(legkevesebbnap)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19528 KiB
2Accepted0/071ms31980 KiB
3Accepted2/243ms19552 KiB
4Accepted2/243ms19604 KiB
5Accepted2/245ms19436 KiB
6Accepted2/254ms21736 KiB
7Accepted2/252ms21740 KiB
8Accepted2/252ms21804 KiB
9Accepted2/250ms21688 KiB
10Accepted2/259ms21724 KiB
11Accepted2/268ms31884 KiB
12Accepted2/281ms31908 KiB
13Accepted2/271ms31800 KiB
14Accepted2/278ms31960 KiB
15Accepted2/271ms31820 KiB
16Accepted2/279ms31976 KiB
17Accepted2/279ms31980 KiB
18Accepted2/270ms31876 KiB
19Accepted2/281ms31976 KiB
20Accepted2/270ms31876 KiB
21Accepted2/281ms31948 KiB
22Accepted2/276ms31972 KiB
23Accepted2/271ms31856 KiB
24Accepted2/268ms31884 KiB
25Accepted2/282ms31980 KiB
26Accepted2/268ms31980 KiB
27Accepted2/278ms31980 KiB