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;
vector<int> a;
void init(int N, vector<int> H) {
a = H;
}
int max_towers(int L, int R, int D) {
vector<int> dp(R + 1, 1);
for (int i = L; i < R; i++){
int mx = a[i + 1];
for (int j = i + 2; j <= R; j++){
if (a[i] <= mx - D && a[j] <= mx - D) dp[j] = max(dp[j], dp[i] + 1);
mx = max(mx, a[j]);
}
}
return *max_element(dp.begin() + L, dp.begin() + R + 1);
}
# | 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... |