Submission #1023028

#TimeUsernameProblemLanguageResultExecution timeMemory
1023028vjudge1Radio Towers (IOI22_towers)C++17
11 / 100
4062 ms1624 KiB
#include "towers.h" #include<bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define pii pair<int, int> #define ff first #define ss second int a[200100]; int n; int dp[200100]; void init(int N, vector<int> H) { n = N; for(int i=0; i<n; i++) a[i + 1] = H[i]; } int max_towers(int L, int R, int D) { L ++; R ++; dp[L-1] = 0; for(int i=L; i<=R; i++){ int mx = 0; dp[i] = 1; for(int j=i-1; j>=L; j--){ //cout<<i<<' '<<j<<' '<<mx<<'\n'; if(mx - D >= a[i] and mx - D >= a[j]) dp[i] = max(dp[i], dp[j]+1); mx = max(mx, a[j]); } } int ans = 0; for(int i=L; i<=R; i++){ 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...