제출 #794896

#제출 시각아이디문제언어결과실행 시간메모리
794896coding_snorlaxGap (APIO16_gap)C++14
30 / 100
40 ms2108 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; vector<long long int> Data1; vector<long long int> Data2; long long findGap(int T, int N) { long long int mn=-1,mx=1e18+1; mx+=1; for(int i=1;i<=(N+1)/2;i++){ MinMax(mn+1,mx-1,&mn,&mx); Data1.push_back(mn); Data2.push_back(mx); } long long int answer = 0; for(long long int i=0;i<(int)Data1.size()-1;i++){ answer=max(answer,Data1[i+1]-Data1[i]); } answer=max(answer,Data2.back()-Data1.back()); for(long long int i=0;i<(int)Data2.size()-1;i++){ answer=max(answer,-Data2[i+1]+Data2[i]); } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...