Submission #23297

#TimeUsernameProblemLanguageResultExecution timeMemory
23297repeatingGap (APIO16_gap)C++11
30 / 100
53 ms7488 KiB
#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)

using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
long long findGap(int ,int );
ll a[300006];
long long findGap(int t,int n){
    ll l=0,r=1e18;
    ll res=0;
    ll i=0,j=n-1;
    W(i<=j){
        MinMax(l,r,&l,&r);
        a[i]=l;
        a[j]=r;
        r--,l++;
        i++,j--;
    }
    for(int i=1;i<n;i++)res=max(res,a[i]-a[i-1]);
    R res;
}
//int main(){
//    cout<<findGap(1,4);
//}
//void MinMax(ll s,ll t,ll *mn,ll *mx){
//    cout<<s<<" "<<t<<endl;
//    cin>>*mn>>*mx;
//}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...