제출 #1076738

#제출 시각아이디문제언어결과실행 시간메모리
1076738laurasofiaGap (APIO16_gap)C++14
30 / 100
35 ms1368 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; #define vv vector<int> #define ll long long #define FOR(i,a,b) for(int i=a;i<b;i++) long long findGap(int T, int N) { ll l,r; MinMax(0,1e18,&l,&r); N-=2; ll res=0; while(l+1<=r-1 && N>0){ ll a,b; MinMax(l+1, r-1, &a, &b); if (a==-1)break; res=max({res, a-l, r-b}); N-=2; l=a;r=b; } res=max(res, r-l); return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...