제출 #711597

#제출 시각아이디문제언어결과실행 시간메모리
711597t6twotwo송신탑 (IOI22_towers)C++17
0 / 100
4062 ms1700 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
vector<int> H;
void init(int _N, vector<int> _H) {
    N = _N;
    H = _H;
}
int max_towers(int L, int R, int D) { R++;
    auto dc = [&](auto dc, int l, int r, int lim) -> int {
        if (l >= r) return 0;
        int x = l, mn = H[l];
        for (int i = l; i < r; i++) {
            if (H[i] > H[x]) x = i;
            mn = min(mn, H[i]);
        }
        return max(mn + D <= lim ? 1 : 0, (l + 1 == x ? 1 : dc(dc, l, x - 1, H[x] - D)) + (r - 2 == x ? 1 : dc(dc, x + 1, r, H[x] - D)));
    };
    return dc(dc, L, R, numeric_limits<int>::max());
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...