203862026-01-06 17:25:14algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 46/5029ms816 KiB
// UUID: ada21a09-6fd5-42fc-accb-a58181511f68
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p;
	cin>>n>>p;
	vector<int>v(n);
	cin>>v[0];
	for(int i=1; i<n; i++){
		int a;
		cin>>a;
		v[i]=v[i-1]+a;
	}
	int k=0, min=0;
	if(p > 0){
	while(k<(n-1) && v[k] < p){
		k++;
	}
	if(v[k] > p-1){
		min=k;
	}
	for(int i=1; i<n; i++){
		while(k < (n-1) && (v[k]-v[i]) < p){
			k++;
		}
		if(min > (k-i) && (v[k]-v[i]) > (p-1)){
			min=k-i;
		}
	}
	}
	cout<<min;
}
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/01ms316 KiB
2Accepted0/028ms748 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms508 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms560 KiB
10Accepted2/24ms436 KiB
11Accepted2/228ms564 KiB
12Accepted2/228ms564 KiB
13Accepted2/229ms564 KiB
14Accepted2/229ms748 KiB
15Accepted2/229ms564 KiB
16Accepted2/229ms568 KiB
17Accepted2/228ms564 KiB
18Accepted2/229ms760 KiB
19Accepted2/229ms564 KiB
20Accepted2/229ms816 KiB
21Accepted2/229ms564 KiB
22Accepted2/229ms756 KiB
23Wrong answer0/229ms812 KiB
24Accepted2/229ms564 KiB
25Accepted2/229ms756 KiB
26Accepted2/229ms756 KiB
27Accepted2/229ms756 KiB