Submission #743254

#	Time	Username	Problem	Language	Result	Execution time	Memory
743254		vjudge1	Rice Hub (IOI11_ricehub)	C++17	0 / 100	4 ms	1108 KiB

ricehub

#include "ricehub.h"

#include<bits/stdc++.h>

using namespace std ;

using ll = long long ; 
using pii = pair<ll , ll> ; 

const int N = 1e6+5 ; 

ll qs[N] , ans = 0; 

deque<pii> dq ; 

int besthub(int R, int L, int X[], long long B)
{
  for(int i=0;i<R;i++){
      qs[X[i]]++ ; 
  }
  for(int i=1;i<=L;i++){
    qs[i] += qs[i-1] ; 
  }
  
  dq.push_back({0 , -1});
    for(int i=0;i<=L;i++){
        while(!dq.empty() && dq.front().second < i - B){
            dq.pop_front();
        }
        ans = max(ans , qs[i] - dq.front().first) ;

        while(!dq.empty() && dq.back().first >= qs[i]){
            dq.pop_back();
        }
        dq.push_back({qs[i] , i});
    }

    return ans ; 
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32