# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
176089 |
2020-01-07T21:17:39 Z |
Doda |
Pismo (COCI18_pismo) |
C++14 |
|
16 ms |
1016 KB |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
long long n,a[100005],raz,najz=1000000001;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
cin >> a[0];
for (int i = 1;i<n;i++){
cin >> a[i];
if (a[i] < a[i-1])
raz = a[i-1]-a[i];
if (a[i] > a[i-1])
raz = a[i]-a[i-1];
if (raz < najz)
najz = raz;
}
cout << najz;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
15 ms |
1016 KB |
Output is correct |
6 |
Correct |
16 ms |
1016 KB |
Output is correct |
7 |
Correct |
15 ms |
1016 KB |
Output is correct |