202582026-01-05 18:07:49algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 46/5082ms31988 KiB
# UUID: 9a9aa9d1-7eee-48dc-ba5b-c7878eb93948
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
Run = True
while YPO<INPA:
    if Cosszeg >= INPB and YPO + 1 <= INPA:
        idoszakok = min(idoszakok, CLepesek)
        XPO += 1
        #YPO = XPO
        CLepesek -= 1
        Cosszeg -= A[XPO]
    else:
        CLepesek += 1
        YPO += 1
        if YPO < INPA:
            Cosszeg += A[YPO]
        

print(idoszakok)

#3 6 4 2 3 7 2 9
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/039ms19616 KiB
2Accepted0/079ms31924 KiB
3Accepted2/246ms19604 KiB
4Accepted2/239ms19632 KiB
5Wrong answer0/246ms19436 KiB
6Accepted2/250ms21500 KiB
7Accepted2/252ms21668 KiB
8Accepted2/259ms21736 KiB
9Accepted2/257ms21592 KiB
10Accepted2/252ms21696 KiB
11Accepted2/278ms31972 KiB
12Accepted2/271ms31788 KiB
13Accepted2/271ms31792 KiB
14Accepted2/279ms31980 KiB
15Accepted2/279ms31980 KiB
16Accepted2/268ms31964 KiB
17Accepted2/279ms31964 KiB
18Accepted2/276ms31976 KiB
19Accepted2/271ms31784 KiB
20Accepted2/270ms31948 KiB
21Accepted2/279ms31988 KiB
22Accepted2/279ms31788 KiB
23Wrong answer0/282ms31808 KiB
24Accepted2/268ms31940 KiB
25Accepted2/271ms31872 KiB
26Accepted2/278ms31800 KiB
27Accepted2/276ms31892 KiB