205692026-01-07 18:19:13algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5030ms1088 KiB
// UUID: 9620cb01-8635-48e7-b9d5-87d244d58050
#include <bits/stdc++.h>
using namespace std;

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

	vector<int> ossz_fiz(n+1);
	ossz_fiz[0] = 0;

	for(int i = 1; i < n+1; i ++){
		ossz_fiz[i] = ossz_fiz[i - 1] + fizetesek[i-1];
	}

	int b = 1;
	int j = 1;
	int min = n+1;
	while(b < n+1 && j < n+1){
		while (j < n+1 && ossz_fiz[j] - ossz_fiz[b - 1] < p){
			j++;
		}
		if(j - b + 1 < min){
			min = j - b + 1;
		}
		b++;
	}
	cout << min;

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/029ms1076 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms508 KiB
8Accepted2/24ms436 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms432 KiB
11Accepted2/229ms1060 KiB
12Accepted2/229ms1080 KiB
13Accepted2/229ms1052 KiB
14Accepted2/229ms1072 KiB
15Accepted2/230ms1076 KiB
16Accepted2/229ms1076 KiB
17Accepted2/230ms1056 KiB
18Accepted2/229ms1088 KiB
19Accepted2/229ms1076 KiB
20Accepted2/229ms1076 KiB
21Accepted2/229ms1088 KiB
22Accepted2/229ms1076 KiB
23Accepted2/229ms1076 KiB
24Accepted2/229ms1056 KiB
25Accepted2/229ms1084 KiB
26Accepted2/229ms1076 KiB
27Accepted2/229ms1076 KiB