240772026-02-04 07:39:15szentedLeggyorsabb pénzkeresés (50)cpp17Wrong answer 2/5029ms860 KiB
#include <iostream>

using namespace std;

int main()
{
    int n;
    int p;
    int a[100000];
    cin >> n;
    cin >> p;
    for(int i=0; i<n; i++){
        cin >> a[i];
    }

    int s=0;
    int mini_napok=n;
    int napok=0;
    int i=0;

    int kezd=0;
    int veg=0;

    while(s<p && veg<=n){
        s=s+a[veg];
        if(s<p){
            veg++;
        }
        else{
            if(s>=p){
                if(napok<mini_napok) mini_napok=napok;
                s=s-a[kezd];
                kezd++;
                napok--;
            }
        }
        napok++;
    }
    cout << mini_napok;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/028ms564 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/24ms416 KiB
11Accepted2/228ms712 KiB
12Wrong answer0/228ms540 KiB
13Wrong answer0/228ms664 KiB
14Wrong answer0/229ms784 KiB
15Wrong answer0/228ms748 KiB
16Wrong answer0/228ms568 KiB
17Wrong answer0/228ms636 KiB
18Wrong answer0/228ms564 KiB
19Wrong answer0/228ms576 KiB
20Wrong answer0/228ms564 KiB
21Wrong answer0/228ms564 KiB
22Wrong answer0/228ms564 KiB
23Wrong answer0/228ms564 KiB
24Wrong answer0/228ms564 KiB
25Wrong answer0/228ms860 KiB
26Wrong answer0/228ms564 KiB
27Wrong answer0/228ms564 KiB