Submission #633382

#	Time	Username	Problem	Language	Result	Execution time	Memory
633382		Lawliet	Radio Towers (IOI22_towers)	C++17	11 / 100	4078 ms	1736 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100010;

int n;

int v[maxn];
int dp[maxn];

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

    for(int i = 1 ; i <= n ; i++)
        v[i] = H[i - 1];
}

int max_towers(int L, int R, int D) 
{
    L++; R++;
    int ans = 0;

    for(int i = R ; i >= L ; i--)
    {
        dp[i] = 0;
        int maxTower = v[i + 1];

        for(int j = i + 2 ; j <= R ; j++)
        {
            if( v[i] <= maxTower - D && v[j] <= maxTower - D )
                dp[i] = max( dp[i] , dp[j] );

            maxTower = max( maxTower , v[j] );
        }

        dp[i]++;
        ans = max( ans , dp[i] );
    }

    return ans;
}

• Subtask 1: 0 / 4
• Subtask 2: 11 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23