For this Question: You take part in <b>N</b> quizzes and in the i<sup>th</sup> quiz you get a score of Q<sub>i</sub>. Your friends are very competitive with you and they ask you the strength of your quiz scores. Strength of an array is defined as the following:

The maximum growth Q<sub>j</sub> - Q<sub>i</sub> (Q<sub>j</sub> > Q<sub>i</sub>) between two quizzes i and j such that i < j and there is no quiz <b>k</b> such that <b>i < k < j</b> and <b>Q<sub>k</sub> > Q<sub>i</sub></b>.
<b>If there is no such pair of indexes, print -1. </b>

Print the strength of your quiz marks in order to impress your friends.First line contains a single integer N, the number of quizzes.
The second line contains N space seperated integers Q<sub>1</sub>, Q<sub>2</sub>,. , Q<sub>N</sub> the score in each quiz.

Constraints:
 1 <= N <= 10<sup>5</sup>
 1 <= Q<sub>i</sub> <= 10<sup>9</sup>Print the strength of your quiz marks.Sample Input:
6
7 10 7 2 1 8

Sample Output:
7

Explaination:
There is a growth of 7 from Q<sub>5</sub> (= 1) to Q<sub>6</sub>(= 8). There is no growth in the array greater than this., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using T = pair<int, int>;
typedef long double ld;
const int mod = 1e9 + 7;
const int INF = 1e9;

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto &i : a) cin >> i;
    int ans = -1;
    stack<int> s;
    for(int i = n - 1; i >= 0; i--){
        while(s.size() > 0 && s.top() <= a[i]){
            s.pop();
        }
        if(s.size()) ans = max(ans, s.top() - a[i]);
        s.push(a[i]);
    }
    cout << ans;
}

signed main(){
    fast
    int t = 1;
    // cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
        if(i != t) cout << endl;
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?