# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
905999 | 2024-01-13T09:05:37 Z | starchan | Gap (APIO16_gap) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; #define in pair<int, int> #define int long long #define f first #define s second #define pb push_back #define pob pop_back #define INF (int)2e18 #define MX (int)3e5+5 #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) int findgap1(int n) { vector<int> a(n); int l = 0; int r = n-1; int cl = 0; int cr = 1e18; while(l <= r) { MinMax(cl, cr, a[l], a[r]); cl = a[l++]+1; cr = a[r--]-1; } int ok = 0; for(int i = 0; i < n-1; i++) ok = max(ok, a[i+1]-a[i]); return ok; } int findgap2(int n) { return 0; } //dummy real function int findGap(signed T, signed n) { int t = T; int N = n; if(t == 1) return findgap1(n); else return findgap2(n); }