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 <bits/stdc++.h>
#define INF 1e18
using namespace std;
vector<int> H;
vector<bool> seg;
int N;
bool ok(int l, int r, int d)
{
for (int i = l+1; i < r; i++)
{
if (max(H[l], H[r]) <= H[i]-d) return true;
}
return false;
}
void init(int n, vector<int> h)
{
H = h;
N = n;
}
int max_towers(int L, int R, int D)
{
int ans = 1;
for (int last = L; last <= L+1; last++)
{
int cur_ans = 1;
for (int i = last+2; i <= R; i++)
{
if (ok(last, i, D))
{
cur_ans++;
last = i++;
}
}
ans = max(ans, cur_ans);
}
return ans;
}
// int main()
// {
// init(7, {10, 20, 60, 40, 50, 30, 70});
// cout << max_towers(1, 5, 10) << endl; // Ans:- 3
// cout << max_towers(2, 2, 100) << endl; // Ans:- 1
// cout << max_towers(0, 6, 17) << endl; // Ans:- 2
// return 0;
// }
# | 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... |