제출 #1076761

#제출 시각아이디문제언어결과실행 시간메모리
1076761TFFGap (APIO16_gap)C++17
0 / 100
41 ms2172 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int t, int n) { long long mn, mx, left, right; left = 0; right = 1000000000000000000; mn = mx = 0; vector<long long> arr1, arr2; for (int i = 0; i < (n + 1) / 2; i++) { MinMax(left, right, &mn, &mx); arr1.push_back(mn); arr2.push_back(mx); left = mn + 1; right = mx - 1; } long long ans = arr2.back() - arr1.back(); for (int i = 0; i < (int)arr1.size() - 1; i++) { ans = max(ans, arr1[i + 1] - arr1[i]); } for (int i = (int)arr2.size() - 2; i >= 0; i--) { ans = max(ans, arr2[i + 1] - arr2[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...