This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |