# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1026379 | Mardonbekhazratov | Radio Towers (IOI22_towers) | C++17 | 4097 ms | 2252 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include <vector>
using namespace std;
int n,k;
vector<int>h;
bool su1=true;
void init(int N, std::vector<int> H) {
n=N;
h=H;
k=0;
bool ok=true;
for(int i=1;i<n;i++){
if(h[i]>h[i-1] && ok) k=i;
else{
if(h[i]>h[i-1]) su1=false;
ok=false;
}
}
}
int max_towers(int L, int R, int D) {
if(su1 && L<k && R>k && h[k]-D>=h[L] && h[k]-D>=h[R]) return 2;
vector<int>a,dp(R-L+1);
dp[0]=1;
for(int i=L;i<=R;i++){
a.push_back(h[i]);
}
int ans=1;
for(int i=1;i<a.size();i++){
int mx=0;
dp[i]=0;
for(int j=i-1;j>=0;j--){
if(a[j]-D>=a[i]) mx=max(a[j],mx);
if(mx-D>=a[j]) dp[i]=max(dp[i],dp[j]);
}
dp[i]++;
ans=max(ans,dp[i]);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |