229962026-01-16 10:27:52SzBeatrixHőségriadó (50 pont)cpp17Wrong answer 4/5023ms712 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k, l, f, db=0, db2=0, db3=0;
    bool hosegriado=0;
    cin>>n>>k>>l>>f;
    int t[n];
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    for(int i=0; i<n; i++)
    {
        if(t[i]>f)
        {
            db++;
        }
        if(hosegriado==0&&db==k)
        {
            db2++;
            hosegriado=1;
        }
        if(t[i]<f)
        {
            db3++;
        }
        if(hosegriado==1&&db3==l)
        {
            hosegriado=0;
            db=0;
        }
    }
    cout<<db2;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/50
1Accepted0/01ms316 KiB
2Wrong answer0/023ms564 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/41ms332 KiB
9Wrong answer0/49ms504 KiB
10Wrong answer0/412ms596 KiB
11Wrong answer0/414ms444 KiB
12Wrong answer0/412ms564 KiB
13Wrong answer0/417ms712 KiB
14Wrong answer0/42ms316 KiB
15Wrong answer0/420ms576 KiB
16Wrong answer0/420ms636 KiB
17Wrong answer0/420ms564 KiB