203932026-01-06 17:34:26algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 16/5030ms1024 KiB
// UUID: e3ea4ef5-3c5e-4250-84c2-aa9ecf696e48
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, p, j, legk, mpenz;
	cin >> n >> p;
	j = 0;
	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;
					}
				mpenz -= v[i];
				break;
			}
		}
		
	}
	cout << legk;
}
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/01ms316 KiB
2Accepted0/030ms564 KiB
3Wrong answer0/21ms500 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Wrong answer0/24ms316 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms436 KiB
11Accepted2/230ms564 KiB
12Wrong answer0/229ms564 KiB
13Wrong answer0/229ms564 KiB
14Wrong answer0/229ms800 KiB
15Accepted2/230ms1024 KiB
16Wrong answer0/230ms564 KiB
17Accepted2/230ms564 KiB
18Accepted2/230ms564 KiB
19Wrong answer0/230ms824 KiB
20Wrong answer0/230ms816 KiB
21Wrong answer0/230ms564 KiB
22Wrong answer0/229ms564 KiB
23Wrong answer0/230ms564 KiB
24Accepted2/230ms756 KiB
25Accepted2/230ms564 KiB
26Wrong answer0/230ms564 KiB
27Wrong answer0/229ms760 KiB