제출 #1247515

#제출 시각아이디문제언어결과실행 시간메모리
1247515fskaricaRadio Towers (IOI22_towers)C++20
0 / 100
4070 ms1572 KiB
#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

const int MAX = 1e5 + 10;
int n;
int maxx;
int arr[MAX];

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

    maxx = 1;
    for (int i = 1; i <= n; i++) {
        if (H[i - 1] > H[maxx - 1]) maxx = i;
        arr[i] = H[i - 1];
    }
}

int max_towers(int lt, int rt, int d) {
    lt++, rt++;
    int sol = 0;

    for (int i = lt; i <= rt; i++) {
        int cnt = 0;
        int bla = true;

        for (int j = lt; j <= rt; j++) {
            if (arr[j] <= arr[i] && bla) {
                cnt++;
                bla = false;
            }
            else if (arr[i] <= arr[j] - d) bla = true;
        }

        sol = max(sol, cnt);
    }

    return sol;
}
#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...