# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
40675 | 2018-02-06T18:29:31 Z | Hassoony | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include<unordered_map> using namespace std; typedef unsigned long long ll; typedef double D; const ll inf=(1ll<<61); const ll mod=1e9+7; const int MX=1e5+9; vector<ll>v; ll findGap(int T, int N){ ll l=0,r=1e18; MinMax(l,r,l,r); v.push_back(l); v.push_back(r); l++;r--; while(1){ if(l!=-1&&l<=r){ MinMax(l,r,l,r); v.push_back(l); v.push_back(r); l++;r--; } else break; } sort(v.begin(),v.end()); ll ans=0; for(int i=0;i<N-1;i++){ ans=max(ans,v[i+1]-v[i]); } return ans; } int main(){ }