Submission #1162281

#TimeUsernameProblemLanguageResultExecution timeMemory
1162281MinhKienGap (APIO16_gap)C++20
0 / 100
11 ms1208 KiB
#include <iostream>

using namespace std;

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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...