# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987266 | 0pt1mus23 | Pismo (COCI18_pismo) | C++14 | 9 ms | 1884 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.
#pragma GCC optimize("O3","inline")
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define ins insert
#define pb push_back
#define int long long
#define pii pair<int,int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl;return;
#define reach cerr<<"reached >.<!"<<endl;
/*
m : 11059739 -> l ~23
p : 4567896467
*/
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 +7, sze=2e5 +5,inf=LLONG_MAX, prime = 2333;
//\\
:pepeblacklove: :dp/st/sp/bs/gr: :pepeblacklove:
//
void gkd(){
int n;
cin>>n;
vector<int> arr(n);
int ans=inf;
for(int i=0;i<n;i++){
cin>>arr[i];
if(i){
ans=min(ans,abs(arr[i]-arr[i-1]));
}
}
drop(ans);
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
int tt=1;
// cin>>tt;
while(tt--) gkd();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |