204432026-01-06 18:41:38SomogyiHőségriadó (50 pont)cpp17Wrong answer 14/5024ms760 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int K, L , F , n;
    cin >> n >> K >> L >> F;

    vector <int> nap(n);
    for (int i=0; i<n; i++)
    {
        cin >> nap[i];
    }

    int db1=0, db2=0, hoseg=0;
    bool riado=false;
    for (int i=0; i<n; i++)
    {
        if (nap[i]>=F)
        {
            db1++;
            db2=0;
        }
        else
        {
            db2++;
            db1=0;
        }
        if (db1==K && !riado)
        {
            hoseg++;
            riado=true;
        }
        if (db2==L || L==0)
        {
            riado=false;
        }
    }

    cout << hoseg;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms556 KiB
2Wrong answer0/024ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms500 KiB
8Wrong answer0/41ms316 KiB
9Wrong answer0/49ms576 KiB
10Wrong answer0/412ms612 KiB
11Wrong answer0/414ms564 KiB
12Wrong answer0/412ms608 KiB
13Wrong answer0/418ms564 KiB
14Accepted4/43ms616 KiB
15Wrong answer0/421ms760 KiB
16Wrong answer0/421ms564 KiB
17Wrong answer0/421ms564 KiB