202832026-01-05 19:21:01algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 28/5079ms31980 KiB
# UUID: 8d2a351b-8639-437f-94a8-edd52e6da44c
INPA, INPB = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]


idoszakok = INPA
CLepesek = 0
XPO = 0
YPO = 0
Cosszeg = 0
while YPO<INPA:
    if Cosszeg >= INPB:
        idoszakok = min(idoszakok, CLepesek)
        XPO += 1
        #YPO = XPO
        CLepesek -= 1
        Cosszeg -= A[XPO]
    else:
        CLepesek += 1
        if YPO < INPA:
            Cosszeg += A[YPO]
        YPO += 1
        

print(idoszakok)

#3 6 4 2 3 7 2 9
SubtaskSumTestVerdictTimeMemory
base28/50
1Wrong answer0/039ms19620 KiB
2Wrong answer0/079ms31912 KiB
3Wrong answer0/243ms19392 KiB
4Wrong answer0/239ms19428 KiB
5Accepted2/246ms19436 KiB
6Wrong answer0/252ms21476 KiB
7Accepted2/252ms21736 KiB
8Accepted2/252ms21680 KiB
9Wrong answer0/259ms21496 KiB
10Accepted2/257ms21832 KiB
11Wrong answer0/267ms31860 KiB
12Accepted2/271ms31812 KiB
13Accepted2/279ms31916 KiB
14Wrong answer0/268ms31920 KiB
15Wrong answer0/270ms31968 KiB
16Accepted2/279ms31952 KiB
17Wrong answer0/279ms31808 KiB
18Wrong answer0/270ms31876 KiB
19Accepted2/279ms31976 KiB
20Accepted2/271ms31872 KiB
21Accepted2/268ms31836 KiB
22Accepted2/278ms31792 KiB
23Accepted2/278ms31836 KiB
24Wrong answer0/268ms31924 KiB
25Wrong answer0/270ms31980 KiB
26Accepted2/276ms31980 KiB
27Accepted2/275ms31792 KiB