# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236936 | super_j6 | Pismo (COCI18_pismo) | C++14 | 19 ms | 640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int maxn = 100000;
int n;
int a[maxn];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
int ret = 1000000000;
for(int i = 0; i < n; i++){
cin >> a[i];
if(i) ret = min(ret, abs(a[i] - a[i - 1]));
}
cout << ret << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |