218222026-01-14 08:44:27bombinigusiniLeggyorsabb pénzkeresés (50)cpp17Wrong answer 46/5029ms956 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, p;
    cin>>n>>p;
    int t[n];
    for (int i=0; i<n; i++) cin>>t[i];
    int ossz=0, k=0, row=n, j=0;
    while(ossz<p)
    {
        ossz+=t[j];
        j++;
    }
    for(int i=j; i<n; i++)
    {
        ossz+=t[i];
        for(k; ossz-t[k]>=p; k++)
        {
            ossz-=t[k];
            if(i-k<row) row=i-k;
        }
    }
    cout<<row;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/01ms316 KiB
2Accepted0/028ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Accepted2/24ms412 KiB
9Accepted2/24ms508 KiB
10Accepted2/24ms428 KiB
11Accepted2/228ms676 KiB
12Accepted2/228ms644 KiB
13Accepted2/228ms624 KiB
14Accepted2/228ms548 KiB
15Accepted2/228ms748 KiB
16Accepted2/228ms944 KiB
17Accepted2/228ms580 KiB
18Accepted2/228ms564 KiB
19Accepted2/229ms564 KiB
20Accepted2/229ms956 KiB
21Accepted2/229ms800 KiB
22Accepted2/229ms748 KiB
23Wrong answer0/228ms540 KiB
24Accepted2/228ms568 KiB
25Accepted2/228ms780 KiB
26Accepted2/228ms784 KiB
27Accepted2/228ms564 KiB