forked from krishna14kant/Data-Structures-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1360B.cpp
36 lines (35 loc) · 856 Bytes
/
1360B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
//🎃🎃🎃😎😎😁🤓☣☣☣☣☣dark_coder☣☣☣☣☣😎😎😁🤓🎃🎃🎃
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define li long long int
#define pi pair<int, int>
int main()
{
IOS int t;
cin >> t;
while (t--)
{
vector<int> v;
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
v.push_back(temp);
}
int mind = INT_MAX;
for (int i = 0; i < v.size() - 1; i++)
{
if (v[i + 1] - v[i] < mind)
mind = v[i + 1] - v[i];
}
cout<<mind<<endl;
}
return 0;
}