Submission #967877

#TimeUsernameProblemLanguageResultExecution timeMemory
96787712345678Radio Towers (IOI22_towers)C++17
11 / 100
29 ms1980 KiB
#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;

int n, dp[nx];
vector<int> h;

void init(int N, std::vector<int> H) {
    n=N;
    h=H;
}

int max_towers(int L, int R, int D) {
    int res=0;
    for (int i=L; i<=R; i++)
    {
        dp[i]=1;
        int mx=0;
        for (int j=i-1; j>=L; j--) 
        {
            mx=max(mx, h[j]);
            if (mx-h[j]>=D&&mx-h[i]>=D) dp[i]=max(dp[i], dp[j]+1);
        }
        res=max(res, dp[i]);
    }
    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...