제출 #764113

#제출 시각아이디문제언어결과실행 시간메모리
764113dxz05송신탑 (IOI22_towers)C++17
0 / 100
4099 ms3664 KiB
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")

#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> a;
void init(int N, vector<int> H) {
    a = H;
}

int calc(int l, int r, int h, int d){
    if (l > r) return 0;
    if (r - l + 1 <= 2) return a[l] <= h || a[r] <= h;

    int m = l;
    for (int i = l; i <= r; i++){
        if (a[i] > a[m]) m = i;
    }

    return calc(l, m - 1, a[m] - d, d) + calc(m + 1, r, a[m] - d, d);
}

int max_towers(int L, int R, int D) {
    return max(1, calc(L, R, 2e9, D));
}
#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...