Submission #20,556

20556

2026-01-07 17:58:49

pypy3

Accepted 50/50

86ms

31988 KiB

# UUID: be1f0f3a-8ec7-4daa-acec-0631d07093fd
c, b = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
mini = c
most = 0
ossz = 0
k = 0 # jobb vegpont
x = 0 # bal vegpont
for j in range(c):
    ossz += a[k]
    #if ossz < b:
    #    ossz += a[k]
    most += 1
    #else:
    while ossz >= b:
        if most < mini:
            mini = most
        ossz -= a[x]
        x += 1
        most -= 1
    k += 1
        
print(mini)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	39ms	19424 KiB
		2	Accepted	0/0	85ms	31920 KiB
		3	Accepted	2/2	39ms	19428 KiB
		4	Accepted	2/2	43ms	19460 KiB
		5	Accepted	2/2	39ms	19432 KiB
		6	Accepted	2/2	57ms	21732 KiB
		7	Accepted	2/2	57ms	22236 KiB
		8	Accepted	2/2	54ms	21732 KiB
		9	Accepted	2/2	64ms	22500 KiB
		10	Accepted	2/2	61ms	22472 KiB
		11	Accepted	2/2	75ms	31904 KiB
		12	Accepted	2/2	86ms	31836 KiB
		13	Accepted	2/2	82ms	31808 KiB
		14	Accepted	2/2	74ms	31928 KiB
		15	Accepted	2/2	72ms	31988 KiB
		16	Accepted	2/2	71ms	31952 KiB
		17	Accepted	2/2	71ms	31980 KiB
		18	Accepted	2/2	82ms	31824 KiB
		19	Accepted	2/2	79ms	31924 KiB
		20	Accepted	2/2	86ms	31796 KiB
		21	Accepted	2/2	70ms	31888 KiB
		22	Accepted	2/2	86ms	31976 KiB
		23	Accepted	2/2	75ms	31864 KiB
		24	Accepted	2/2	86ms	31820 KiB
		25	Accepted	2/2	74ms	31796 KiB
		26	Accepted	2/2	81ms	31844 KiB
		27	Accepted	2/2	71ms	31924 KiB