# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97451 | KLPP | Pismo (COCI18_pismo) | C++14 | 68 ms | 1912 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<bits/stdc++.h>
using namespace std;
typedef long long int lld;
lld absol(lld x){
if(x>0)return x;
return -x;
}
int main(){
int n;
cin>>n;
lld arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
lld ans=20000000000;
for(int i=0;i<n-1;i++)ans=min(ans,absol(arr[i]-arr[i+1]));
cout<<ans<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |