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;
//subtask 4
const int nax = 100005;
int n;
int pre[nax];
void init(int N, vector<int> H) {
  n = N;
  for(int i=1; i<n-1; ++i) {
    if(H[i]>H[i-1] && H[i]>H[i+1]) pre[i] = 1;
    pre[i] += pre[i-1];
  }
}
int max_towers(int L, int R, int D) {
  if(R==0) return 1;
  return pre[R-1] - pre[L] + 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... |