205482026-01-07 17:48:17algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5082ms32000 KiB
# UUID: 52df52aa-890a-4c8d-bc86-d0819d70ba0a
n,p=[int(x) for x in input().split()]
f=[int(x) for x in input().split()]+[0]
i=0
j=0
nap=n
penz=0
while j<n+1:
    #print(penz,i,j)
    if p > penz:
        penz=penz+f[j]
        j+=1
    else:
        nap=min(nap,j-i)
        penz=penz-f[i]
        i+=1
print(nap)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19628 KiB
2Accepted0/081ms31800 KiB
3Accepted2/245ms19372 KiB
4Accepted2/239ms19400 KiB
5Accepted2/246ms19428 KiB
6Accepted2/250ms21656 KiB
7Accepted2/250ms21732 KiB
8Accepted2/259ms21656 KiB
9Accepted2/257ms21480 KiB
10Accepted2/252ms21724 KiB
11Accepted2/270ms31860 KiB
12Accepted2/282ms32000 KiB
13Accepted2/279ms31864 KiB
14Accepted2/270ms31924 KiB
15Accepted2/271ms32000 KiB
16Accepted2/270ms31928 KiB
17Accepted2/279ms31956 KiB
18Accepted2/276ms31952 KiB
19Accepted2/271ms31964 KiB
20Accepted2/281ms31980 KiB
21Accepted2/268ms31992 KiB
22Accepted2/268ms31792 KiB
23Accepted2/279ms31956 KiB
24Accepted2/270ms31968 KiB
25Accepted2/271ms31980 KiB
26Accepted2/279ms31800 KiB
27Accepted2/279ms31996 KiB