Submission #1035132

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035132		NeroZein	송신탑 (IOI22_towers)	C++17	0 / 100	487 ms	1900 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std; 

const int LOG = 18; 

int n;
vector<int> h;
vector<int> pref;

void init(int N_, vector<int> H_) {
  n = N_, h = H_;
  pref.resize(n - 1);
  for (int i = 1; i < n - 1; ++i) {
    pref[i] = (h[i - 1] < h[i]) && (h[i] < h[i + 1]);
  }
  for (int i = 1; i < n - 1; ++i) {
    pref[i] += pref[i - 1]; 
  }
}

int max_towers(int l, int r, int d) {
  assert(d == 1); 
  if (l == r) {
    return 1; 
  }
  int ans = max(1, pref[r - 1] - pref[l]);
  return ans;
}

• 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