Submission #18,612

2025-10-28 15:22:08

python3

Accepted 40/40

96ms

14924 KiB

n, p = map(int, input().split())
ar = tuple(map(int, input().split()))

left = 0
sum = 0
max_sum = 0
for right in range(n):
    sum += ar[right]
    while sum > p:
        sum -= ar[left]
        left += 1
    if max_sum < right - left + 1:
        max_sum = right - left + 1
print(max_sum)

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	16ms	3316 KiB
		2	Accepted	0/0	96ms	14924 KiB
		3	Accepted	2/2	14ms	2868 KiB
		4	Accepted	2/2	16ms	2868 KiB
		5	Accepted	2/2	16ms	2872 KiB
		6	Accepted	2/2	16ms	2868 KiB
		7	Accepted	2/2	17ms	2988 KiB
		8	Accepted	3/3	17ms	3152 KiB
		9	Accepted	3/3	17ms	3240 KiB
		10	Accepted	3/3	18ms	3380 KiB
		11	Accepted	3/3	19ms	3384 KiB
		12	Accepted	3/3	59ms	8896 KiB
		13	Accepted	3/3	64ms	10228 KiB
		14	Accepted	3/3	71ms	8808 KiB
		15	Accepted	3/3	86ms	12380 KiB
		16	Accepted	3/3	90ms	13244 KiB
		17	Accepted	3/3	92ms	13784 KiB