제출 #115439

#제출 시각아이디문제언어결과실행 시간메모리
115439nvmdavaGap (APIO16_gap)C++17
0 / 100
655 ms5084 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

long long findGap(int T, int N)
{
    long long s, t;
    MinMax(1, 1000000000000000000, &s, &t);
    long long l, r;
    l = s + 1;
    long long sz = (t - s + 1) / N;
    long long lf = s, res = 0;
    long long a, b;
    while(l < t){
        r = l + sz;
        cerr<<l<<' '<<r<<'\n';
        MinMax(l, r, &a, &b);
        if(a != -1) res = max(res, a - lf);
        if(b != -1) lf = b;
        l = r + 1;
    }
    res = max(res, t - lf);
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...