Submission #199811

#TimeUsernameProblemLanguageResultExecution timeMemory
199811mohamedsobhi777Pismo (COCI18_pismo)C++14
70 / 70
64 ms376 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+5 , mod = 1e9 +7 ;

int n;
int ans = 1e9;

int main()
{
    vector< pair<int , int> > v;
    cin>>n;
    int l= -1;
    for(int i = 0;i<n;i++)
    {
        int t ;
        cin>>t;
        if(t==l)
            continue;
        if(i)
            ans = min(ans , abs(t - l) );
        l = t;
    }
    cout<<(ans==1e9?0:ans);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...