203872026-01-06 17:25:50algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms1000 KiB
// UUID: 840cec7c-1693-4212-af7d-6c33fc1a2fc0
#include <bits/stdc++.h>
#include <climits>
#include <vector>
#include <iostream>



using namespace std;

int main() {
	int N,P;
	cin >> N >> P;

	vector<int> v(N);

	for(int i{0};i < N;++i)
	{
		cin >> v[i];
	}

	int bal{0};
	int jobb{0};
	int ans{INT_MAX};
	int cur{v[0]};
	
	while(true)
	{
		if(cur < P)
		{
			++jobb;
			if(jobb == N)
			 	break;
			cur += v[jobb];
		}
		else if(cur >= P)
		{
			if(jobb-bal+1 < ans)
				ans = jobb-bal+1;
			cur -= v[bal];
			bal++;
		}
	}

	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/030ms568 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms508 KiB
10Accepted2/24ms316 KiB
11Accepted2/230ms612 KiB
12Accepted2/229ms804 KiB
13Accepted2/230ms960 KiB
14Accepted2/230ms696 KiB
15Accepted2/229ms832 KiB
16Accepted2/232ms564 KiB
17Accepted2/230ms564 KiB
18Accepted2/229ms564 KiB
19Accepted2/229ms756 KiB
20Accepted2/230ms564 KiB
21Accepted2/230ms564 KiB
22Accepted2/230ms564 KiB
23Accepted2/230ms564 KiB
24Accepted2/232ms564 KiB
25Accepted2/232ms568 KiB
26Accepted2/230ms564 KiB
27Accepted2/230ms1000 KiB