제출 #24673

#제출 시각아이디문제언어결과실행 시간메모리
24673chan492811Gap (APIO16_gap)C++11
0 / 100
93 ms4240 KiB
#include "gap.h" #include <cstdio> #include <algorithm> #define ll long long #define MAX_V (ll)1e18 using namespace std; ll res; long long findGap(int t, int n){ int i; ll l, r, nl, nr, now, tmp; MinMax(0ll, MAX_V, &l, &r); if(t == 1){ n -= 2; while(n > 0){ MinMax(l + 1, r - 1, &nl, &nr); res = max(res, max(r - nr, nl - l)); l = nl; r = nr; } res = max(res, r - l); MinMax(0ll, MAX_V, &l, &r); return res; } res = now = (r - l + (n - 2)) / (n - 1); nl = l; for(i = 1; i < n; i++){ MinMax(l + now * (i - 1) + 1, l + now * i, &nr, &tmp); res = max(res, nr - nl); nl = tmp; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...