Submission #798465

#	Time	Username	Problem	Language	Result	Execution time	Memory
798465		jakobrs	Radio Towers (IOI22_towers)	C++17	0 / 100	4054 ms	1360 KiB

towers

#include <vector>
#include <iostream>

int n;
std::vector<int> h;

void init(int N, std::vector<int> H) {
  n = N;
  h = H;
}

int max_towers(int L, int R, int D) {
  if (L == R) return 1;
  R += 1;

  std::vector<int> included { h[L] };
  int greatest = h[L];
  for (int i = L + 1; i < R; i++) {
    if (h[i] > greatest) {
      greatest = h[i];
    } else if (greatest - included.back() < D) {
      if (h[i] < included.back()) {
        included.pop_back();
        included.push_back(h[i]);
        greatest = h[i];
      }
    } else {
      included.push_back(h[i]);
      greatest = h[i];
    }
  }

  return included.size();
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23