제출 #668305

#제출 시각아이디문제언어결과실행 시간메모리
668305danikoynovGap (APIO16_gap)C++14
30 / 100
89 ms5896 KiB

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

long long findGap(int T, int N)
{
    ll inf = 1e18;
    ll lf = 0, rf = 1e18, mn, mx;
    MinMax(0, inf, &mn, &mx);
   set < ll > st;
   st.insert(mn);
   st.insert(mx);
   int nn = 2;
   lf = mn + 1;
   rf = mx - 1;
   while(nn < N)
    {

        MinMax(lf, rf, &mn, &mx);
        st.insert(mn);
        st.insert(mx);
        lf = mn + 1;
        rf = mx - 1;
        nn += 2;
    }

    ll ans = 0;
    ll last = -1;
    for (auto it : st)
    {
        if (last != -1)
            ans = max(ans, it - last);
        last = it;
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...