Submission #713095

#TimeUsernameProblemLanguageResultExecution timeMemory
713095lamGap (APIO16_gap)C++14
30 / 100
41 ms1864 KiB
#include <bits/stdc++.h> #define ll long long #include "gap.h" using namespace std; #define ll long long const int maxn = 1e5 + 10; int n; ll a[maxn]; ll sub1() { int l=1; int r=n; ll s = 0; ll t = 1e18; while (l<=r) { ll *mx, *mn; ll mmax, mmin; mx = &mmax; mn = &mmin; // cerr<<l<<' '<<r<<' '<<s<<' '<<t<<endl; MinMax(s,t,mn,mx); s = (mmin)+1; t = (mmax)-1; a[l++]=mmin; a[r--]=mmax; } ll ans = 0; for (int i=2; i<=n; i++) { if (ans<a[i]-a[i-1]) ans=a[i]-a[i-1]; } return ans; } ll findGap(int T, int N) { n=N; if (T==1) return sub1(); else return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...