Submission #76710778

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <vector>
#include <random>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <unordered_map>

using namespace std;

const int N = 2e5 + 10;

int n;
int t[N];
vector<int> gap;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
    }
    for (int i = 2; i <= n; i++) {
        gap.push_back(t[i] - t[i - 1]);
    }
    
    sort(gap.begin(), gap.end());
    
    cout << gap[0] << ' ' << gap[n - 2] << '\n';
    
    return 0;
}

Submission Info

Judge Result