Submission #682975

#TimeUsernameProblemLanguageResultExecution timeMemory
682975irmuunRadio Towers (IOI22_towers)C++17
0 / 100
4094 ms1360 KiB
#include<bits/stdc++.h> #include "towers.h" using namespace std; const int N=1e5; int n,k; vector<int>a; void init(int N,vector<int>h){ n=N; a=h; } int max_towers(int l,int r,int d){ int dp[n+5]; dp[l]=1; for(int i=l+1;i<=r;i++){ dp[i]=1; for(int j=i+2;i<=r;j++){ for(int k=i+1;k<j;k++){ if(a[i]+d<=a[k]&&a[j]+d<=a[j]){ dp[i]=max(dp[j]+1,dp[i]); } } } } 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...