Submission #460747

#TimeUsernameProblemLanguageResultExecution timeMemory
460747KhizriRice Hub (IOI11_ricehub)C++17
0 / 100
5 ms332 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" int besthub(int n, int l, int arr[], long long k) { int ans=0; queue<ll>q; for(int i=0;i<n;i++){ while(q.size()&&arr[i]-q.front()>k){ q.pop(); } q.push(arr[i]); ans=max(ans,(int)q.size()); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...