203812026-01-06 17:21:44algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 2/5029ms816 KiB
// UUID: 12e9fdfa-c972-484d-a50f-d95e3ed4d2fe
#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{
				break;
			}
		}
		if(j - i  < legk){
			legk = j - i + 1;
		}
		mpenz -= v[i];
	}
	cout << legk;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/028ms564 KiB
3Wrong answer0/21ms500 KiB
4Wrong answer0/21ms492 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Wrong answer0/24ms316 KiB
9Wrong answer0/24ms436 KiB
10Wrong answer0/24ms316 KiB
11Accepted2/228ms564 KiB
12Wrong answer0/228ms808 KiB
13Wrong answer0/228ms564 KiB
14Wrong answer0/228ms804 KiB
15Wrong answer0/228ms816 KiB
16Wrong answer0/228ms800 KiB
17Wrong answer0/228ms564 KiB
18Wrong answer0/229ms796 KiB
19Wrong answer0/228ms756 KiB
20Wrong answer0/228ms804 KiB
21Wrong answer0/228ms572 KiB
22Wrong answer0/228ms564 KiB
23Wrong answer0/229ms752 KiB
24Wrong answer0/229ms564 KiB
25Wrong answer0/229ms800 KiB
26Wrong answer0/229ms564 KiB
27Wrong answer0/228ms564 KiB