205712026-01-07 18:19:50algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 0/5028ms824 KiB
// UUID: d14fc1f3-40dd-4e52-b377-96278a19ddbd
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <ostream>
#include <vector>
using namespace std;

int main() {
	int n,p = 0;
	cin>>n >> p;

	vector<int>v(n);

	for(int i=0;i<n;i++)
	{
		cin>>v[i];
	}

/*
	cout<<"V elemei: ";
	for(int x :v)cout<<x <<" ";
	cout<< "\n";
*/

	int r = 1;
	int minl = 1;
	int osszeg = v[0];
	int ans = 1e8;

	for(int l=0;l<n;l++)
	{
		
		while(r!=n && osszeg < p)
		{
			osszeg += v[r];
			if(osszeg >= p)
			{
				ans = min(r-l+1,ans);
			}
			r++;
		}
	}
	cout<<minl << endl;

}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms544 KiB
2Wrong answer0/028ms756 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Wrong answer0/24ms316 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/228ms564 KiB
12Wrong answer0/228ms808 KiB
13Wrong answer0/228ms800 KiB
14Wrong answer0/228ms812 KiB
15Wrong answer0/228ms564 KiB
16Wrong answer0/228ms564 KiB
17Wrong answer0/228ms804 KiB
18Wrong answer0/228ms800 KiB
19Wrong answer0/228ms824 KiB
20Wrong answer0/228ms632 KiB
21Wrong answer0/228ms804 KiB
22Wrong answer0/228ms804 KiB
23Wrong answer0/228ms804 KiB
24Wrong answer0/228ms612 KiB
25Wrong answer0/228ms800 KiB
26Wrong answer0/228ms808 KiB
27Wrong answer0/228ms756 KiB