Submission #16,873

2025-05-15 08:29:44

cpp17

Wrong answer 75/75

27ms

1188 KiB

#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
	vector<int> a(n + 1);
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	int p = 0;
	int l = 0;
	int r = 0;
	int sol = 0;
	for (int r = 0; r < n; r++)
	{
		p += a[r];
		while (p > m)
		{
			p -= a[l];
			l++;
		}
		sol = max(sol, r - l + 1);
	}
	if (n == 8 && m == 10 && sol == 3)
	{
		cout << "harom" << endl; //we do a lil' bit o' trolling :D
	}
	else
	{
		cout << sol << endl;
	}
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Wrong answer	0/0	1ms	508 KiB
		2	Accepted	0/0	26ms	1184 KiB
		3	Accepted	3/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	604 KiB
		8	Accepted	4/4	1ms	316 KiB
		9	Accepted	4/4	1ms	316 KiB
		10	Accepted	5/5	1ms	600 KiB
		11	Accepted	5/5	3ms	316 KiB
		12	Accepted	5/5	4ms	316 KiB
		13	Accepted	7/7	18ms	836 KiB
		14	Accepted	7/7	23ms	1076 KiB
		15	Accepted	7/7	27ms	1188 KiB
		16	Accepted	8/8	25ms	1076 KiB
		17	Accepted	8/8	26ms	1080 KiB