Submission #21,801

2026-01-14 08:06:33

cpp17

Accepted 50/50

23ms

668 KiB

#include <iostream>

using namespace std;

int main()
{
    int n, k, l, f, s=0, r=0, x=0;
    cin>>n>>k>>l>>f;
    int t[n];
    bool riado=false;
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
        if(riado==false)
        {
            if(t[i]>f){
                s++;
                x=0;
            }
            if(t[i]<f){
                s=0;
                x++;
            }
            if(t[i]==f){s=0;x=0;}
            if(s==k and t[i]!=f){
                riado=true;
                r++;
                }
        }
        if(riado==true)
        {
            if(t[i]>f){
                s++;
                x=0;
            }
            if(t[i]<f){
                s=0;
                x++;
            }
            if(t[i]==f){s=0;x=0;}
            if(x==l){
                riado=false;
            }
        }
    }
    cout << r;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	23ms	584 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	4/4	1ms	384 KiB
		9	Accepted	4/4	9ms	464 KiB
		10	Accepted	4/4	12ms	584 KiB
		11	Accepted	4/4	14ms	616 KiB
		12	Accepted	4/4	12ms	488 KiB
		13	Accepted	4/4	17ms	564 KiB
		14	Accepted	4/4	3ms	316 KiB
		15	Accepted	4/4	20ms	568 KiB
		16	Accepted	4/4	20ms	668 KiB
		17	Accepted	4/4	20ms	564 KiB