제출 #1110497

#제출 시각아이디문제언어결과실행 시간메모리
1110497NewtonabcGap (APIO16_gap)C++14
0 / 100
28 ms1276 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long arr[N];
long long findGap(int T, int N)
{
    long long aa,bb;
  MinMax(1000,0,&aa,&bb);
	if(T==1){
		long long ans=LLONG_MIN;
		int lind=1,rind=N;
		long long l=0,r=1e18,mn,mx;
		while(lind<=rind){
			MinMax(l,r,&mn,&mx);
			if(mn==-1) break;
			arr[lind]=mn,arr[rind]=mx;
			lind++,rind--;
			l=mn+1,r=mx-1;
		}
		for(int i=1;i<N;i++){
			ans=max(ans,arr[i+1]-arr[i]);
		}
		/*for(int i=0;i<N;i++) cout<<arr[i] <<" ";
		cout<<"\n\n";*/
		return ans;
	}
	
		
	
}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...