제출 #910431

#제출 시각아이디문제언어결과실행 시간메모리
910431ibm2006Gap (APIO16_gap)C++17
30 / 100
31 ms3528 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; typedef long long int ll; ll n,s,l,r,x,y,z,w,a[1100000],i,j,k,m; long long findGap(int T, int N) { n=N; if(T==1) { l=0; r=1e18-1; x=1; y=n; while(l<r) { MinMax(l,r,&l,&r); a[x]=l; a[y]=r; x++; y--; if(l==r||x>y) break; l++; r--; } for(i=1;i<n;i++) { s=max(s,a[i+1]-a[i]); } return s; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...