203982026-01-06 17:37:18algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 48/5032ms828 KiB
// UUID: 69656843-2edd-41cd-a0a6-f9c296e16153
#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{
				if(j - i  < legk){
					legk = j - i;
					}
				
				break;
			}
		}
		mpenz -= v[i];
		
	}
	cout << legk;
}
SubtaskSumTestVerdictTimeMemory
base48/50
1Accepted0/01ms316 KiB
2Accepted0/030ms756 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms324 KiB
6Accepted2/24ms432 KiB
7Accepted2/24ms432 KiB
8Accepted2/24ms508 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/230ms564 KiB
12Accepted2/229ms564 KiB
13Accepted2/230ms564 KiB
14Accepted2/230ms800 KiB
15Accepted2/230ms804 KiB
16Accepted2/229ms564 KiB
17Accepted2/230ms756 KiB
18Accepted2/229ms564 KiB
19Accepted2/230ms812 KiB
20Accepted2/230ms564 KiB
21Accepted2/230ms752 KiB
22Accepted2/229ms564 KiB
23Accepted2/230ms564 KiB
24Wrong answer0/230ms564 KiB
25Accepted2/230ms828 KiB
26Accepted2/232ms564 KiB
27Accepted2/230ms564 KiB