1799 2022. 12. 03 19:02:15 kdb Utazásszervezés (75 pont) cpp11 Accepted 75/75 4ms 4100 KiB 
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, m, k, c;
    cin >> n >> m >> k >> c;
    if (n >= c)
    {
        cout << c << endl;
        return 0;
    }
    vector<int> vec, vec2;
    for (size_t i = 0; i < c; i++)
    {
        int a;
        cin >> a;
        vec.push_back(a);
        if (i < n) vec2.push_back(a);
    }
    int j = 0, q = n;
    for (int i = n; i < c; i++)
    {
        if (vec[i] - k >= vec2[j])
        {
            vec2[j] = vec[i];
            j++;
            q++;
        }
        if (j == n) j = 0;
    }
    cout << q << endl;
    return 0;
}
/*
2 10 4 6
1 2 2 5 6 7
-4
*/
Subtask Sum Test Verdict Time Memory
base 75/75
1 Accepted 0/0 3ms 1828 KiB
2 Accepted 0/0 4ms 2552 KiB
3 Accepted 3/3 3ms 2268 KiB
4 Accepted 4/4 3ms 2528 KiB
5 Accepted 4/4 3ms 2616 KiB
6 Accepted 4/4 2ms 2744 KiB
7 Accepted 4/4 3ms 3084 KiB
8 Accepted 4/4 3ms 3144 KiB
9 Accepted 5/5 3ms 3240 KiB
10 Accepted 5/5 3ms 3336 KiB
11 Accepted 6/6 3ms 3452 KiB
12 Accepted 6/6 3ms 3500 KiB
13 Accepted 6/6 3ms 3756 KiB
14 Accepted 6/6 4ms 4016 KiB
15 Accepted 6/6 4ms 4100 KiB
16 Accepted 6/6 4ms 4096 KiB
17 Accepted 6/6 4ms 4096 KiB