제출 #1330432

#제출 시각아이디문제언어결과실행 시간메모리
1330432SpyrosAliv송신탑 (IOI22_towers)C++20
0 / 100
4061 ms1576 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> h;

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

int max_towers(int L, int R, int D) {
  vector<int> dp(n, 1);
  int ans = 1;
  int d = D;
  for (int i = L+2; i <= R; i++) {
    int mx = h[i-1];
    for (int j = i-2; j >= L; j--) {
      if (h[j] + d <= mx && h[i] + d <= mx) dp[i] = max(dp[i], dp[j] + 1);
    }
    ans = max(ans, dp[i]);
  }
  return ans;
}
#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...