제출 #1020312

#제출 시각아이디문제언어결과실행 시간메모리
1020312kym송신탑 (IOI22_towers)C++17
0 / 100
4078 ms1580 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>A;
int n;
void init(int N, std::vector<int> H) {
  n=N;
  A=H;
}

int max_towers(int L, int R, int D) {
  int dp[n+5];memset(dp,0,sizeof dp);
  for(int i=0;i<n;i++)dp[i]=1;
  int ans=1;
  for(int i=L+2;i<=R;i++){
    int mx=A[i-1];
    for(int j=i-2;j>=0;j--){
      if(mx-D>=A[i] && mx-D >= A[j]){
        dp[i]=max(dp[i],dp[j]+1);
        ans=max(ans,dp[i]);
      }
      mx=max(mx,A[j]);
    }
  }
  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...