Submission #836868

#TimeUsernameProblemLanguageResultExecution timeMemory
836868Abrar_Al_Samit송신탑 (IOI22_towers)C++17
14 / 100
647 ms1480 KiB
#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 max(1, pre[R-1] - pre[L] + 1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...