153782025-02-19 10:09:56MrkzLeggyorsabb pénzkeresés (50)cpp17Wrong answer 46/5030ms808 KiB
#include <iostream>
using namespace std;
int N,P;
int main()
{
    cin>>N>>P;
    int F[N],j=-1,mini=N,ossz=0,db=0;
    for(int i=1;i<=N;i++){
        cin>>F[i];
    }
    for(int i=1;i<=N;i++){
        if(j<i)j=i;
        while(ossz<=P && j<=N){
            ossz+=F[j];
            j++;

        }
        if(ossz>=P) mini=min(mini,j-i);
        ossz-=F[i];
    }
    cout<<mini;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base46/50
1Wrong answer0/01ms316 KiB
2Accepted0/028ms564 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Accepted2/24ms416 KiB
9Accepted2/24ms508 KiB
10Accepted2/24ms436 KiB
11Accepted2/228ms548 KiB
12Accepted2/228ms612 KiB
13Accepted2/228ms660 KiB
14Accepted2/228ms752 KiB
15Accepted2/228ms576 KiB
16Accepted2/228ms564 KiB
17Accepted2/228ms596 KiB
18Accepted2/228ms688 KiB
19Accepted2/228ms600 KiB
20Accepted2/230ms728 KiB
21Accepted2/228ms604 KiB
22Accepted2/228ms776 KiB
23Wrong answer0/228ms564 KiB
24Accepted2/228ms564 KiB
25Wrong answer0/228ms568 KiB
26Accepted2/228ms568 KiB
27Accepted2/228ms808 KiB