254402026-02-20 09:18:31SzeredaiNatanaelLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5013ms1332 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n; long long p;
	cin >> n >> p;
	vector<long long> v(n + 1);
	for (int i = 1; i <= n; ++i)
		cin >> v[i];

	long long sum = 0;
	int l = 1, min_l = n + 1;
	for (int r = 1; r <= n; ++r) {
		sum += v[r];

		while (sum >= p) {
			min_l = min(min_l, r - l + 1);
			sum -= v[l];
			++l;
		}
	}

	if (min_l == n + 1) {
		cout << "0\n";
	}
	else {
		cout << min_l << "\n";
	}
	
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/012ms1076 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/22ms316 KiB
7Accepted2/22ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/22ms424 KiB
10Accepted2/22ms316 KiB
11Accepted2/212ms1076 KiB
12Accepted2/212ms1076 KiB
13Accepted2/212ms1076 KiB
14Accepted2/213ms1092 KiB
15Accepted2/212ms1076 KiB
16Accepted2/212ms1076 KiB
17Accepted2/212ms1084 KiB
18Accepted2/212ms1076 KiB
19Accepted2/212ms1092 KiB
20Accepted2/212ms1332 KiB
21Accepted2/212ms1076 KiB
22Accepted2/213ms1076 KiB
23Accepted2/212ms1076 KiB
24Accepted2/212ms1076 KiB
25Accepted2/212ms1076 KiB
26Accepted2/212ms1076 KiB
27Accepted2/212ms1076 KiB