150272025-02-11 12:25:12ercseferencLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms784 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m; cin>>n>>m; int a[n];
    for(int i=0; i<n; i++){cin>>a[i];}
    int s=0,k=0,p=0,l=0;
    while(s<m){s+=a[p]; p++;} int mini=p; p--;
    while(p<n-1){
        p++; s+=a[p];
        while(s-a[l]>=m){s-=a[l]; l++;}
        if(p-l+1<mini)mini=p-l+1;}
    cout<<mini;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/030ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms436 KiB
7Accepted2/24ms408 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms412 KiB
10Accepted2/24ms388 KiB
11Accepted2/230ms784 KiB
12Accepted2/230ms744 KiB
13Accepted2/230ms740 KiB
14Accepted2/230ms712 KiB
15Accepted2/230ms680 KiB
16Accepted2/232ms736 KiB
17Accepted2/232ms592 KiB
18Accepted2/230ms600 KiB
19Accepted2/230ms756 KiB
20Accepted2/230ms564 KiB
21Accepted2/230ms756 KiB
22Accepted2/230ms748 KiB
23Accepted2/230ms560 KiB
24Accepted2/230ms740 KiB
25Accepted2/230ms740 KiB
26Accepted2/230ms564 KiB
27Accepted2/230ms664 KiB