202722026-01-05 18:31:35algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5085ms31984 KiB
# UUID: dc3d82f6-1fcb-41d3-9f15-c1d5ff18484d
n, p = [int(x) for x in input().split()]
f = [int(x) for x in input().split()]

bal = 0
osszeg = 0
min_nap = n 

for jobb in range(n):
    osszeg += f[jobb]

    while osszeg >= p:
        min_nap = min(min_nap, jobb - bal + 1)
        osszeg -= f[bal]
        bal += 1


print(min_nap)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19428 KiB
2Accepted0/083ms31960 KiB
3Accepted2/239ms19404 KiB
4Accepted2/243ms19436 KiB
5Accepted2/237ms19452 KiB
6Accepted2/250ms21604 KiB
7Accepted2/264ms22248 KiB
8Accepted2/261ms21740 KiB
9Accepted2/254ms22244 KiB
10Accepted2/252ms21736 KiB
11Accepted2/283ms31788 KiB
12Accepted2/276ms31884 KiB
13Accepted2/282ms31976 KiB
14Accepted2/272ms31836 KiB
15Accepted2/282ms31980 KiB
16Accepted2/279ms31980 KiB
17Accepted2/272ms31984 KiB
18Accepted2/271ms31808 KiB
19Accepted2/282ms31980 KiB
20Accepted2/285ms31984 KiB
21Accepted2/270ms31980 KiB
22Accepted2/275ms31896 KiB
23Accepted2/276ms31804 KiB
24Accepted2/285ms31812 KiB
25Accepted2/271ms31848 KiB
26Accepted2/282ms31800 KiB
27Accepted2/271ms31980 KiB