# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1012036 | 2024-07-01T14:46:15 Z | codefox | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include "gap.h" #define ll long long long long findGap(int T, int N) { ll l = 0; ll r = 1e18; ll mxdist = 0; ll nl = 0; ll nr = 0; ll fl = -1; ll fr = -1; for (int j = 0; j < n && l<=r; j+=2) { MinMax(l, r, &nl, &nr); if (nr==-1) break; if (fl != -1 && nl-fl>mxdist) mxdist = nl-fl; if (fr != -1 && fr-nr>mxdist) mxdist = fr-nr; fl = nl; fr = nr; l = nl+1; r = nr-1; } if (fr-fl>mxdist) mxdist = fr-fl; return mxdist; }