Submission #946422

#TimeUsernameProblemLanguageResultExecution timeMemory
946422n3rm1nGap (APIO16_gap)C++17
0 / 100
34 ms3608 KiB
#include<bits/stdc++.h> #include "gap.h" using namespace std; const int MAXN = 2e5 + 10; long long a[MAXN]; long long findGap(int T, int N) { long long s = 0, t = (long long)(1e18); long long mn, mx; int n = N; int filled0 = 0, filled1 = n+1; while(filled0 + 1 <= filled1 - 1) { ///cout << mn << " " << mx << endl; MinMax(s, t, &mn, &mx); if(mn == mx) { filled0 ++; a[filled0] = mn; n --; break; } filled0 ++; filled1 --; n-= 2; a[filled0] = mn; a[filled1] = mx; s = mn + 1; t = mx - 1; } long long ans = 0; for (int i = 2; i <= n; ++ i) { ans = max(ans, a[i] - a[i-1]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...