203962026-01-06 17:35:57algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 16/5030ms820 KiB
// UUID: bd16d8fc-c08b-45e7-98a1-28c1f763159c
#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;
					}
				
				break;
			}
		}
		mpenz -= v[i];
		
	}
	cout << legk;
}
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/01ms316 KiB
2Accepted0/030ms564 KiB
3Wrong answer0/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/24ms436 KiB
7Wrong answer0/24ms640 KiB
8Wrong answer0/24ms348 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Accepted2/230ms564 KiB
12Wrong answer0/230ms800 KiB
13Wrong answer0/230ms564 KiB
14Wrong answer0/230ms612 KiB
15Accepted2/230ms564 KiB
16Wrong answer0/229ms564 KiB
17Accepted2/230ms564 KiB
18Accepted2/229ms564 KiB
19Wrong answer0/229ms820 KiB
20Wrong answer0/229ms808 KiB
21Wrong answer0/230ms808 KiB
22Wrong answer0/229ms564 KiB
23Wrong answer0/229ms596 KiB
24Accepted2/230ms816 KiB
25Accepted2/229ms820 KiB
26Wrong answer0/230ms564 KiB
27Wrong answer0/230ms564 KiB