In this HackerEarth Bubble Sort problem solution, You are given arrays a1,a2,...,an. What will return the next function Bubble Sort (A).


HackerEarth Bubble Sort problem solution


HackerEarth Bubble Sort problem solution.

#include <bits/stdc++.h>
using namespace std;

int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
int result = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
--a[i];
result = max(result, i - a[i]);
}
++result;
cout << result << '\n';
return 0;
}

Second solution

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 2e5 + 14;
int n, a[maxn], ans;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
ans = max(ans, i - a[i]);
}
cout << ans + 1 << '\n';
}