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 <vector>
using namespace std;
const int N = 100000;
typedef vector<int> vi;
int aa[N], i;
void init(int n, vi aa_) {
int i;
for (i = 0; i < n; i++)
aa[i] = aa_[i];
i = 0;
while (i < n - 1 && aa[i] < aa[i + 1])
i++;
}
int max_towers(int l, int r, int d) {
return l < i && i < r && aa[i] - aa[l] >= d && aa[i] - aa[r] >= d ? 2 : 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... |