Submission #731282

#TimeUsernameProblemLanguageResultExecution timeMemory
7312821neGap (APIO16_gap)C++14
30 / 100
55 ms1880 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { long long s = -1,t = 1e18 + 1; long long x = 0,y = 0; vector<long long>pos(N); int l = 0,r = N - 1; while(l <= r && s<=t){ MinMax(s,t,&x,&y); if (x == -1 && y == -1){ break; } pos[l] = x; pos[r] = y; --r; ++l; s = x + 1; t = y - 1; } long long ans = 0; sort(pos.begin(),pos.end()); for (int i = 1;i<N;++i){ ans = max(ans,pos[i] - pos[i - 1]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...