제출 #785260

#제출 시각아이디문제언어결과실행 시간메모리
785260vjudge1송신탑 (IOI22_towers)C++17
11 / 100
4064 ms1468 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
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) {
    vector<int> dp(N, 1);
    for (int i = L; i <= R; i++) {
        int mx = 0;
        for (int j = i - 1; j >= L; j--) {
            if (mx - D >= max(H[i], H[j])) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
            mx = max(mx, H[j]);
        }
    }
    return *max_element(dp.begin(), dp.end());
}
#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...