제출 #1015116

#제출 시각아이디문제언어결과실행 시간메모리
1015116vjudge1Gap (APIO16_gap)C++17
0 / 100
30 ms2420 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; typedef long long ll; ll findGap(int T, int N){ if (T == 1){ vector<ll> vec; while (N > 0){ N -= 2; ll mn = 0, mx = 1e18; MinMax(mn, mx, &mn, &mx); vec.push_back(mn); vec.push_back(mx); mn++; mx--; } sort(vec.begin(), vec.end()); ll res = 0; for (int i = 1; i < N; i ++) res = max(res, vec[i] - vec[i - 1]); return res; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...