| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1325148 | riafhasan2010 | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int n) {
ll mn, mx, ans = 0, last = 0;
for (int i = 1; i <= n; i++) {
MinMax(mn + 1, mn + 1, mn*, mx*);
if (i > 1) ans = max(ans, mx - last);
last = mn;
}
}
