Submission #133

2021-01-21 20:52:37

cpp11

Accepted 75/75

25ms

2832 KiB

#include <iostream>
#include <vector>

using namespace std;

int N, F, a, b, maxi, sum;

int main()
{
	cin >> N >> F;
	vector <int> x(N + 1, 0);

	for (int i = 1; i <= N; ++i)
		cin >> x[i];

	a = 1;
	sum = x[1];
	maxi = 0;

	for (b = 2; b <= N; ++b)
	{
		sum += x[b];
		while (sum > F)
		{
			sum -= x[a];
			++a;
		}

		if (b - a + 1 > maxi) maxi = b - a + 1;
	}

	cout << maxi << '\n';
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	2ms	1768 KiB
		2	Accepted	0/0	24ms	2832 KiB
		3	Accepted	3/3	1ms	1980 KiB
		4	Accepted	3/3	1ms	2088 KiB
		5	Accepted	3/3	1ms	2084 KiB
		6	Accepted	3/3	1ms	2084 KiB
		7	Accepted	3/3	1ms	1976 KiB
		8	Accepted	4/4	1ms	1976 KiB
		9	Accepted	4/4	1ms	1976 KiB
		10	Accepted	5/5	1ms	2088 KiB
		11	Accepted	5/5	3ms	2120 KiB
		12	Accepted	5/5	4ms	2124 KiB
		13	Accepted	7/7	17ms	2828 KiB
		14	Accepted	7/7	19ms	2824 KiB
		15	Accepted	7/7	23ms	2832 KiB
		16	Accepted	8/8	25ms	2832 KiB
		17	Accepted	8/8	25ms	2828 KiB