제출 #47774

#제출 시각아이디문제언어결과실행 시간메모리
47774ikura355Gap (APIO16_gap)C++14
59.04 / 100
75 ms2296 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long
const ll inf = 2e18;

ll findGap(int T, int N) {
    ll L, R;
    MinMax(0,inf,&L,&R);
    ll sz = (R-L-1)/(N-1);
    ll ans = 0, last = L;
    for(ll x=L+1;x<=R-1;x+=sz) {
        ll t1, t2;
        MinMax(x,min(R-1,x+sz-1),&t1,&t2);
        if(t1==-1) continue;
        ans = max(ans, t1-last);
        last = t2;
    }
    ans = max(ans, R-last);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...