Submission #1062063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062063		MarwenElarbi	Radio Towers (IOI22_towers)	C++17	0 / 100	4073 ms	2484 KiB

towers

#include <bits/stdc++.h>
using namespace std;
#include "towers.h"
#define pb push_back
#define ll long long
#define fi first
#define se second
const int nax=1e5+5;
int n;
vector<int> tab;
void init(int N, std::vector<int> H) {
  n=N;
  for (int i = 0; i < N; ++i)
  {
    tab.pb(H[i]);
  }
}

int max_towers(int L, int R, int D){
  int dp[n];
  int ans=0;
  priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
  int cnt=0;
  for (int i = L; i <= R; ++i)
  {
    dp[i]=cnt+1;
    while(!pq.empty()){
      auto cur=pq.top();
      if(tab[i]-cur.fi>=D){
        pq.pop();
        cnt=max(cnt,cur.se);
      }else break;
    }
    pq.push({tab[i],dp[i]});
    ans=max(ans,dp[i]);
  }
  return ans;
}

• 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