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>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
vector<int> v,pre;
void init(int n, vector<int> h) {
v=h;
pre.resize(n);
for(int i=1;i+1<n;i++){
if(v[i]<v[i-1] && v[i]<v[i+1]){
pre[i]=1;
}
}
for(int i=1;i<n;i++){
pre[i]+=pre[i-1];
}
}
int max_towers(int l, int r, int d) {
if(l==r){
return 1;
}
int u=pre[r-1];
if(l){
u-=pre[l];
}
if(v[l]<v[l+1]){
u++;
}
if(v[r]<v[r-1]){
u++;
}
return u;
}
# | 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... |