202062026-01-04 22:25:15algoproLeggyorsabb pénzkeresés (50)pypy3Accepted 50/5082ms32000 KiB
# UUID: 38081944-453a-47fc-9d2a-d41877b073e9
N, P = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]

res = 10**7
i = j = 0
sum = F[0]
while j < N:
    if sum < P:
        j += 1
        if j < N:
            sum += F[j]
        else:
            break
    else:
        res = min(res, j-i+1)
        sum -= F[i]
        i += 1


print(res)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19392 KiB
2Accepted0/071ms32000 KiB
3Accepted2/243ms19416 KiB
4Accepted2/243ms19408 KiB
5Accepted2/246ms19432 KiB
6Accepted2/257ms21696 KiB
7Accepted2/252ms21560 KiB
8Accepted2/252ms21496 KiB
9Accepted2/250ms21596 KiB
10Accepted2/259ms21648 KiB
11Accepted2/281ms32000 KiB
12Accepted2/271ms31780 KiB
13Accepted2/282ms32000 KiB
14Accepted2/279ms31960 KiB
15Accepted2/282ms32000 KiB
16Accepted2/268ms32000 KiB
17Accepted2/279ms32000 KiB
18Accepted2/281ms32000 KiB
19Accepted2/272ms32000 KiB
20Accepted2/279ms31952 KiB
21Accepted2/270ms32000 KiB
22Accepted2/279ms32000 KiB
23Accepted2/279ms32000 KiB
24Accepted2/268ms32000 KiB
25Accepted2/271ms32000 KiB
26Accepted2/268ms32000 KiB
27Accepted2/276ms32000 KiB