Submission #1140133

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140133		tmm	Swimming competition (LMIO18_plaukimo_varzybos)	C++20	10 / 100	223 ms	8180 KiB

plaukimo_varzybos

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

using namespace std;

const int N_max = 1000005;
int n, A, B;
vector<int> v;
int dp[N_max];
void reading(){
    cin >> n >> A >> B;
    v.resize(n + 1);
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    sort(v.begin() + 1, v.end());
}

int main() {
    reading();
    for(int i = A; i <= n; i++){
        dp[i] = max(v[i] - v[i - A + 1], dp[i - A]);
        for(int j = A + 1; j <= B; j++)
            dp[i] = min(dp[i], max(v[i] - v[i - j + 1], dp[i - j]));
    }
    cout << dp[n];

}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40