Submission #843895

#TimeUsernameProblemLanguageResultExecution timeMemory
843895Elvin_FritlGap (APIO16_gap)C++17
30 / 100
36 ms4236 KiB

#include "gap.h"

#include <bits/stdc++.h>
using namespace std;


long long findGap(int t, int n)
{
    long long mn = 0 , mx = 1e18;
    vector<long long>v;
    int tr = (n+1)/2;
    while(tr--)
    {
        MinMax(mn , mx , &mn , &mx);
        v.push_back(mn);
        if(mn != mx)
            v.push_back(mx);
        mn++;
        mx--;
    }
    sort(v.begin() , v.end());
    long long res = 0;
    for(int i=1;i<n;i++){
        res = max(v[i] - v[i-1] , res);
    }
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...