# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104968 | puyu_liao | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
typedef long long ll;
ll findGap(int T,int n){
if(T==1){
vector<ll> v1,v2;
ll ans = 0;
ll s = 0, t = 1000000000000000000ll,mn,mx;
for(int i=1,j=n;i<j;i++,j--){
MinMax(s,t,&mn,&mx);
v1.push_back(mn);
if(i != j) v2.push_back(mx);
}
reverse(v2.begin(),v2.end());
for(int i : v2) v1.push_back(i);
for(int i=0;i<v1.size()-1;i++) ans = max(ans,v1[i+1]-v1[i]);
return ans;
}
else{
ll ans = 0;
ll s = 0, t = 0,mn,mx,last;
MinMax(s,t,&mn,&mx);
last = mn; s = t = mn+1;
for(int i=1;i<n;i++){
MinMax(s,t,&mn,&mx);
ans = max(ans,mn-last);
last = mn;
s = t = mn+1;
}
return ans;
}
}