Submission #23,466

2026-01-23 10:38:56

cpp17

Wrong answer 72/75

25ms

812 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, x;
	cin >> n >> x;
	vector<int> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
	}
	int l = 0, r = 0;
	long long cost = v[0];
	int ans = 0;

	while (l <= r) {
		
		if (cost <= x && r < n - 1) {
			++r;
			cost += v[r];
		} else {
			cost -= v[l];
			++l;
		}

		if (cost <= x) {
			ans = max(ans, r - l + 1);
		}
	}

	cout << ans << endl;
}

	Sum	Test	Verdict		Time	Memory
base	72/75
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	25ms	564 KiB
		3	Wrong answer	0/3	1ms	316 KiB
		4	Accepted	3/3	1ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	4/4	1ms	316 KiB
		9	Accepted	4/4	1ms	316 KiB
		10	Accepted	5/5	1ms	316 KiB
		11	Accepted	5/5	3ms	508 KiB
		12	Accepted	5/5	3ms	632 KiB
		13	Accepted	7/7	18ms	800 KiB
		14	Accepted	7/7	21ms	812 KiB
		15	Accepted	7/7	25ms	804 KiB
		16	Accepted	8/8	25ms	800 KiB
		17	Accepted	8/8	25ms	568 KiB