#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int mxPos = 0, mx = 0;
void init(int N, vector<int> A) {
n = N;
a.push_back(0);
for (int i = 0; i < n; i++) a.push_back(A[i]);
for (int i = 1; i <= n; i++) {
if (a[i] > mx) {
mx = a[i];
mxPos = i;
}
}
}
int max_towers(int l, int r, int d) {
if (l >= mxPos || r <= mxPos) return 0;
int upp = max(a[l], a[r]) + d;
if (upp > mx) return 0;
else return 2;
}
# | 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... |