137292025-01-08 15:19:26redfoxdeltaLeggyorsabb pénzkeresés (50)python3Accepted 50/50128ms14940 KiB
N, P = [int(i) for i in input().split()]
F = [int (i) for i in input().split()]
M = N # idő min
K = 0
U = -1
V = 0 #van
for K in range (N):
    while U < N-1 and V < P:
        U += 1
        V += F[U]
    if U - K + 1 <= M and V >= P:
        M = U - K +1
    V = V - F[K]
print (M)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/017ms2932 KiB
2Accepted0/0120ms14928 KiB
3Accepted2/217ms3124 KiB
4Accepted2/216ms3116 KiB
5Accepted2/216ms3116 KiB
6Accepted2/227ms4140 KiB
7Accepted2/227ms4404 KiB
8Accepted2/226ms4288 KiB
9Accepted2/226ms4220 KiB
10Accepted2/227ms4152 KiB
11Accepted2/2115ms14888 KiB
12Accepted2/2128ms14844 KiB
13Accepted2/2115ms14836 KiB
14Accepted2/2115ms14940 KiB
15Accepted2/2123ms14936 KiB
16Accepted2/2119ms14880 KiB
17Accepted2/2116ms14880 KiB
18Accepted2/2120ms14744 KiB
19Accepted2/2123ms14828 KiB
20Accepted2/2119ms14932 KiB
21Accepted2/2119ms14788 KiB
22Accepted2/2125ms14928 KiB
23Accepted2/2120ms14920 KiB
24Accepted2/2119ms14708 KiB
25Accepted2/2119ms14932 KiB
26Accepted2/2115ms14928 KiB
27Accepted2/2120ms14900 KiB