# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
187202 | 2020-01-12T13:31:23 Z | rzbt | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define mp make_pair #define pb push_back #define F first #define S second #define all(x) x.begin(),x.end() #define MAXN 100005 //#include "gap.h" typedef long long ll; using namespace std; ll findGap(int t,int n){ ll res=0; ll l,d,tl,td; MinMax(0ll,1000000000000000000ll,&l,&d); while(n>1){ MinMax(l+1,d-1,&tl,&td); res=max(res,max(tl-l,d-td)); l=tl; d=td; n-=2 } return res; }