Submission #824234

#	Time	Username	Problem	Language	Result	Execution time	Memory
824234		Liudas	Radio Towers (IOI22_towers)	C++17	0 / 100	4089 ms	1432 KiB

towers

#include "towers.h"

#include <cassert>
#include <cstdio>

#include <bits/stdc++.h>
using namespace std;
vector<int> h;
void init(int N, vector<int> H){
    h = H;
}
int max_towers(int L, int R, int D){
    int score = 0;
    for(int i = 0; i < *max_element(h.begin(), h.end()); i ++){
        int H = h[i];
        int s = 0;
        bool good = false;
        for(int j = L; j <= R; j ++){
            if(!good && h[j] <= H){
                s ++;
                good = true;
            }
            else if(good && h[j] >= H + D){
                good = false;
            }
        }
        score = max(score, s);
    }
    return score;
}

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