Submission #289012

#TimeUsernameProblemLanguageResultExecution timeMemory
289012shrek12357Gap (APIO16_gap)C++14
0 / 100
34 ms1152 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <set> #include <climits> #include <cmath> #include <fstream> #include <queue> #include "gap.h" using namespace std; long long findGap(int t, int n) { if (t != 3) { return 0; } long long max = 1e18 + 5; long long pre = 0; long long ans = 0; for (int i = 0; i < n; i++) { long long mn, mx; MinMax(0, max, &mn, &mx); if (i == 0) { pre = mx; max = mx - 1; } else { if (pre - mx > ans) { ans = pre - mx; } pre = mx; max = mx - 1; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...