제출 #628869

#제출 시각아이디문제언어결과실행 시간메모리
628869kkkkkkkk송신탑 (IOI22_towers)C++17
11 / 100
4059 ms1488 KiB
#include <bits/stdc++.h> using namespace std; vector<int> height; int N,k=0; void init(int n,vector<int> H) { N=n; height=H; } int max_towers(int l,int r,int d) { int res=1; vector<int> dp(N,1); for (int i=l;i<=r;i++) { int tower=height[i-1]; for (int j=i-2;j>=l;j--) { if (tower-d>=height[j]&&tower-d>=height[i]) dp[i]=max(dp[i],dp[j]+1); tower=max(tower,height[j]); } res=max(dp[i],res); } return res; }
#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...