# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784237 | GordonRemzi007 | Radio Towers (IOI22_towers) | C++17 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int a[1e5+10];
bool srt(pair<int,int> a, pair<int,int> b) {
return a.first < b.first;
}
void init(int size, vector<int> h) {
n = size;
for(int i = 0; i < n; i++) a[i] = h[i];
}
int max_towers(int l, int r, int d) {
int res = 0, f, s;
bool ok;
vector<bool> used(n, false);
vector<pair<int,int>> b(r-l+1);
for(int i = l; i <= r; i++) b[i] = {a[i], i};
sort(b.begin(), b.end(), srt);
for(int i = 0; i < b.size(); i++) {
f = b[i].second, s = b[i].second;
ok = true;
//find closest left and right a[i] >= a[b[i].second]+d
for(; f >= l; f--) {
if(used[f]) {
ok = false;
break;
}
if(a[f] >= a[b[i].second]+d) break;
if(f == l) {
f = b[i].second;
break;
}
}
for(; s <= r; s++) {
if(used[s]) {
ok = false;
break;
}
if(a[s] >= a[b[i].second]+d) break;
if(s == r) {
s = b[i].second;
break;
}
}
if(ok) {
used[b[i].second] = true;
res++;
}
}
return res;
}