# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1094279 | 2024-09-29T09:01:41 Z | mingga | Gap (APIO16_gap) | C++17 | 0 ms | 0 KB |
#include "bits/stdc++.h" #include "gap.h" using namespace std; #define ln "\n" #define dbg(x) cout << #x << " = " << x << ln #define mp make_pair #define pb push_back #define fi first #define se second #define inf 2e18 #define fast_cin() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) #define out(file) freopen(file, "w", stdout) #define in(file) freopen(file, "r", stdin) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define int long long int MOD = 1e9 + 7; int findGap(int T, int N) { if(T == 1) { int mn, mx; int lb = 0, rb = 1e18; int l = 0, r = N - 1; vector<int> a(N, 0); while(l <= r) { MinMax(lb, rb, mn&, mx&); a[l] = mn, a[r] = mx; lb = mn + 1, rb = mx - 1; l++, r--; } int ans = 0; for(int i = 1; i < n; i++) ans = max(ans, a[i] - a[i - 1]); return ans; } }