203612026-01-06 17:03:16algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 2/5032ms992 KiB
// UUID: bf2c934f-3f1b-4966-91b7-2fcf248a35b7
#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=n;
	for(int i=0; i<n; i++){
		while(k < n && (v[k]-v[i]) < p){
			k++;
		}
		if(min > (k-i+1)){
			min=k-i+1;
		}
	}
	cout<<min;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Wrong answer0/01ms500 KiB
2Wrong answer0/030ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms324 KiB
6Wrong answer0/24ms440 KiB
7Wrong answer0/24ms500 KiB
8Wrong answer0/24ms544 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms436 KiB
11Accepted2/230ms564 KiB
12Wrong answer0/230ms564 KiB
13Wrong answer0/230ms564 KiB
14Wrong answer0/230ms824 KiB
15Wrong answer0/230ms756 KiB
16Wrong answer0/230ms564 KiB
17Wrong answer0/230ms564 KiB
18Wrong answer0/232ms796 KiB
19Wrong answer0/230ms992 KiB
20Wrong answer0/230ms564 KiB
21Wrong answer0/230ms564 KiB
22Wrong answer0/230ms748 KiB
23Wrong answer0/232ms748 KiB
24Wrong answer0/232ms564 KiB
25Wrong answer0/232ms564 KiB
26Wrong answer0/232ms756 KiB
27Wrong answer0/230ms756 KiB