Submission #995676

#	Time	Username	Problem	Language	Result	Execution time	Memory
995676		gocha56	Drzava (COCI15_drzava)	C++14	0 / 160	1 ms	600 KiB

drzava

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> cities(n);
    for (int i = 0; i < n; ++i) {
        cin >> cities[i];
    }

    sort(cities.begin(), cities.end());
    int max_cities = 1;
    for (int i = 0; i < n; ++i) {
        int current = 1;
        for (int j = i + 1; j < n; ++j) {
            if (cities[j] - cities[i] <= k) {
                current++;
            } else {
                break;
            }
        }
        max_cities = max(max_cities, current);
    }

    cout << max_cities << endl;
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8
• Subtask 14: 0 / 8
• Subtask 15: 0 / 8
• Subtask 16: 0 / 8
• Subtask 17: 0 / 8
• Subtask 18: 0 / 8
• Subtask 19: 0 / 8
• Subtask 20: 0 / 8