Submission #560909

#TimeUsernameProblemLanguageResultExecution timeMemory
560909CoderNTTGap (APIO16_gap)C++14
30 / 100
56 ms1876 KiB
#include<bits/stdc++.h> #include "gap.h" #define task "CROBOT" #define ll long long #define ld long double #define fi first #define se second using namespace std; const int maxn = 1e5 + 1; const int mod = 1e9 + 7; ll n, m, k, q, l, r, a[maxn]; ll findGap(int t, int n) { if (t == 1) { l = -1, r = 2e18 + 1; for (int i = 1; i <= (n + 1) / 2; i++) { MinMax(l, r, &a[i], &a[n - i + 1]); l = a[i] + 1; r = a[n - i + 1] - 1; } ll ans = -1; for (int i = 2; i <= n; i++) ans = max(ans, a[i] - a[i - 1]); return ans; } }

Compilation message (stderr)

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