제출 #1140145

#제출 시각아이디문제언어결과실행 시간메모리
1140145tmmSwimming competition (LMIO18_plaukimo_varzybos)C++20
10 / 100
464 ms8180 KiB
#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 && i >= j; j++)
            dp[i] = min(dp[i], max(v[i] - v[i - j + 1], dp[i - j]));
    }
    cout << dp[n];

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...