제출 #1187884

#제출 시각아이디문제언어결과실행 시간메모리
1187884WarinchaiGap (APIO16_gap)C++20
30 / 100
28 ms1988 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

long long ar[100005];

long long sub1(long long N){
    for(int i=1;i<=N;i++)ar[i]=0;
    long long l=0,r=1e18;
    long long ll=1,rr=N;
    while(ll<=rr){
        MinMax(l,r,&l,&r);
        ar[ll]=l,ar[rr]=r;
        l++,r--;
        ll++,rr--;
    }
    long long ans=0;
    for(int i=1;i<N;i++)ans=max(ans,ar[i+1]-ar[i]);
    return ans;
}

long long findGap(int T, int N)
{
	return sub1(N);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...