제출 #110379

#제출 시각아이디문제언어결과실행 시간메모리
110379VardanyanGap (APIO16_gap)C++14
30 / 100
70 ms1960 KiB
#include "gap.h" #include <algorithm> using namespace std; long long A[1000*100+1]; long long findGap(int T, int N) { long long s = 0; long long t = 1000000000; t*=t; long long nax; long long as = 0; int tl = 1; int tr = N; long long l = s; long long r = t; while(tl<=tr){ long long ans; long long mn,mx; MinMax(l,r,&mn,&mx); A[tl] = mn; A[tr] = mx; tl++; tr--; l = mn+1; r = mx-1; } for(int i = 1;i<N;i++){ as = max(as,A[i+1]-A[i]); } // cout<<as<<endl; return as; return 0; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:17:19: warning: unused variable 'ans' [-Wunused-variable]
         long long ans;
                   ^~~
gap.cpp:10:15: warning: unused variable 'nax' [-Wunused-variable]
     long long nax;
               ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...