Submission #1160419

#TimeUsernameProblemLanguageResultExecution timeMemory
1160419Kalata_56Gap (APIO16_gap)C++20
0 / 100
29 ms1868 KiB
#include "gap.h" //#include<bits/stdc++.h>; long long mas[100011]; long long findGap(int T,int N){ long long maxa=1e18+1; long long pre=0; long long ans=0; long long l=-1,r=maxa; long long L=0,R=N-1; while(L<=R){ //long long k1,k2; MinMax(l+1,r-1,&mas[L],&mas[R]); L++; R--; l=mas[L-1]; r=mas[R+1]; } for(int i=0;i<N-1;i++){ if(mas[i+1]-mas[i]>ans){ ans=mas[i+1]-mas[i]; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...