Submission #978083

#TimeUsernameProblemLanguageResultExecution timeMemory
978083IUA_HasinGap (APIO16_gap)C++17
30 / 100
34 ms3888 KiB
#include "gap.h" #include <bits/stdc++.h> #define ll long long using namespace std; long long findGap(int T, int N) { ll tempa = 0; ll tempb = 1e18; ll arr[N]; ll l = 0; ll r = N-1; // cout<<tempa<< " " << tempb<<endl; while(true){ if(l<=r){ ll mn, mx; MinMax(tempa, tempb, &mn, &mx); // cout<<mn<<" "<<mx<<endl; mn = (ll)mn; mx = (ll)mx; if(mn==-1 || mx==-1){ break; } else if(mn==mx){ arr[l] = mn; break; } else { tempa = (ll)(mn+1); tempb = (ll)(mx-1); arr[l] = (ll)mn; arr[r] = (ll)mx; l++; r--; } } else { break; } } ll ans = 0; // for(int i=0; i<N; i++){ // cout << arr[i] << " "; // } // cout<<endl; for(int i=1; i<N; i++){ ll temp = (ll)(arr[i]-arr[i-1]); ans = (ll)(max(temp, ans)); } ans = (ll)(ans); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...