def solution():
n = int(input())
c = list(map(int, input().split()))
cnt = 0
mini = []
c.sort()
for i in range(n-1):
mini.append(abs((c[i])-(c[i+1])))
mini_v = min(mini)
for val in mini:
if val == mini_v:
cnt += 1
print("{} {}".format(mini_v, cnt))
t = 1
while t:
t -= 1
solution()
/*************************************************************************
> File Name: a.cpp
> Author:123emm
> Mail: [email protected]
> Created Time: 2023年03月10日 星期五 15时23分19秒
************************************************************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int n; cin >> n;
vector <int> A(n);
for (auto &a : A) cin >> a;
sort(A.begin(), A.end());
int mi = 2e9 + 10;
for (int i = 1; i < n; i++) {
mi = min(mi, A[i] - A[i - 1]);
}
int ans = 0;
for (int i = 1; i < n; i++) {
if (A[i] - A[i - 1] == mi) ans++;
}
cout << mi << " " << ans;
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |