174462025-07-16 22:42:43akososkaLeggyorsabb pénzkeresés (50)cpp17Wrong answer 0/5012ms1140 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    long long n,p,elso=1,lk=LLONG_MAX,s=0;
    int a[100001];
    cin>>n;
    cin>>p;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int i=1;
    while(i<=n){
        if(s+a[i]<p){
            s=s+a[i];
            i++;
        }
        else{
            if(i-elso+1<lk)lk=i-elso+1;
            s=s-elso;
            elso++;
        }
    }
    cout<<lk;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms316 KiB
2Wrong answer0/012ms820 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms500 KiB
6Wrong answer0/22ms500 KiB
7Wrong answer0/22ms316 KiB
8Wrong answer0/22ms316 KiB
9Wrong answer0/22ms548 KiB
10Wrong answer0/22ms448 KiB
11Wrong answer0/212ms932 KiB
12Wrong answer0/212ms1140 KiB
13Wrong answer0/212ms948 KiB
14Wrong answer0/212ms1076 KiB
15Wrong answer0/212ms1056 KiB
16Wrong answer0/212ms960 KiB
17Wrong answer0/212ms992 KiB
18Wrong answer0/212ms876 KiB
19Wrong answer0/212ms900 KiB
20Wrong answer0/212ms952 KiB
21Wrong answer0/212ms940 KiB
22Wrong answer0/212ms1016 KiB
23Wrong answer0/212ms960 KiB
24Wrong answer0/212ms1048 KiB
25Wrong answer0/212ms820 KiB
26Wrong answer0/212ms980 KiB
27Wrong answer0/210ms984 KiB