203772026-01-06 17:17:12algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5030ms804 KiB
// UUID: 25e3878d-5282-4bce-aca4-f986e357a914
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	long long p;
	cin >> n >> p;
	vector <int> fizetes(n);
	for(int i = 0; i < n; i++)
		cin >> fizetes[i];
	long long osszeg = 0;
	int bal = 0;
	int valasz = n + 1;
	for(int i = 0; i < n; i++)
	{
		osszeg += fizetes[i];
		while(osszeg >= p)
		{
			valasz = min(valasz, i- bal + 1);
			osszeg -= fizetes[bal];
			bal++;	
		}
	}
	if(valasz == n + 1)
		cout << 0;
	else
		cout << valasz;

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/028ms564 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms368 KiB
7Accepted2/24ms436 KiB
8Accepted2/24ms440 KiB
9Accepted2/24ms508 KiB
10Accepted2/24ms508 KiB
11Accepted2/228ms564 KiB
12Accepted2/228ms800 KiB
13Accepted2/228ms564 KiB
14Accepted2/230ms564 KiB
15Accepted2/228ms568 KiB
16Accepted2/228ms564 KiB
17Accepted2/228ms564 KiB
18Accepted2/228ms564 KiB
19Accepted2/228ms564 KiB
20Accepted2/228ms564 KiB
21Accepted2/228ms776 KiB
22Accepted2/228ms804 KiB
23Accepted2/228ms760 KiB
24Accepted2/228ms564 KiB
25Accepted2/228ms564 KiB
26Accepted2/228ms796 KiB
27Accepted2/229ms564 KiB