# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94711 | AKaan37 | Pismo (COCI18_pismo) | C++17 | 17 ms | 1144 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 lo;
typedef pair<int,int> PII;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define FOR for(lo i=1;i<= n;i++)
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mid (start+end)/2
const lo mod = 1000000007;
const lo li = 100005;
const lo inf = 1000000000;
const lo MAX = 1000000000000000000;
const lo MIN = -1000000000000000000;
const lo LOG = 30;
lo n,m,cev=inf,a[li];
int main(){
scanf("%lld",&n);
FOR{
scanf("%lld",&a[i]);
}
for(lo i=2;i<=n;i++){
lo mx;
lo mn;
mx=max(a[i-1],a[i]);
mn=min(a[i-1],a[i]);
//~ cout<<mx<<" "<<mn<<endl;
cev=min(cev,mx-mn);
}
printf("%lld\n",cev);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |