# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162280 | MinhKien | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
const int N = 1e5 + 10;
long long a[N];
long long findGap(int T, int n) {
long long ans = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i > 1) ans = max(ans, a[i] - a[i - 1]);
}
return ans;
}