205182026-01-07 16:19:54algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5030ms816 KiB
// UUID: 9c198e08-820d-4d01-b328-6fa411e07d46
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p; cin >> n >> p;
	vector<int> num(n);
	for (int i=0;i<n; i++) cin >> num[i];

	int min_d = INT_MAX;

	int j=0;
	int sum = 0;

	for (int i=0; i<n; i++){
		sum += num[i];

		while (sum >= p){
			min_d = min(min_d, i-j+1);
			sum -= num[j];
			j++;
		}


	}
	cout << min_d;

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/030ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms436 KiB
11Accepted2/230ms564 KiB
12Accepted2/230ms568 KiB
13Accepted2/230ms564 KiB
14Accepted2/230ms812 KiB
15Accepted2/230ms808 KiB
16Accepted2/230ms756 KiB
17Accepted2/230ms564 KiB
18Accepted2/230ms804 KiB
19Accepted2/230ms808 KiB
20Accepted2/230ms812 KiB
21Accepted2/230ms564 KiB
22Accepted2/230ms564 KiB
23Accepted2/230ms564 KiB
24Accepted2/230ms564 KiB
25Accepted2/230ms564 KiB
26Accepted2/230ms816 KiB
27Accepted2/230ms816 KiB