204142026-01-06 17:57:19algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5030ms812 KiB
// UUID: 8cc53e06-3170-40a1-bf27-ac9dc2c0f081
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p, j, legk, mpenz;
	cin >> n >> p;
	j = 1;
	legk = n;
	vector<int> v(n);
	for(int i = 0; i < n; i++){
		cin >> v[i];
	}
	mpenz = v[0];

	for(int i = 0; i < n; i++){
		while(j < n){
			if(mpenz < p){
			mpenz += v[j];
			j++;
			} else{
				break;
			}
		}
		if(mpenz >=p && j - i  < legk){
			legk = j - i;
		}
		mpenz -= v[i];
		
	}
	cout << legk;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/030ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms432 KiB
7Accepted2/24ms508 KiB
8Accepted2/24ms436 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms508 KiB
11Accepted2/230ms812 KiB
12Accepted2/229ms564 KiB
13Accepted2/229ms564 KiB
14Accepted2/230ms564 KiB
15Accepted2/229ms568 KiB
16Accepted2/229ms568 KiB
17Accepted2/229ms564 KiB
18Accepted2/230ms564 KiB
19Accepted2/230ms564 KiB
20Accepted2/229ms564 KiB
21Accepted2/229ms564 KiB
22Accepted2/230ms804 KiB
23Accepted2/230ms564 KiB
24Accepted2/229ms812 KiB
25Accepted2/229ms760 KiB
26Accepted2/230ms564 KiB
27Accepted2/230ms808 KiB