aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-14 15:35:04 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-14 15:35:04 +0200
commit4073555ab4b8d93862b8c1e932f4e2ae86970a60 (patch)
tree922ecf4d69b631484d08a688ad191bbc0daad14a
parentfce97ffb0543bb139ad7c2186e3df12f0a63032d (diff)
downloadcompetitive-programming-4073555ab4b8d93862b8c1e932f4e2ae86970a60.tar.xz
competitive-programming-4073555ab4b8d93862b8c1e932f4e2ae86970a60.zip
Solved MakeItIncreasing in codeforces
-rw-r--r--MakeItIncreasing.cpp24
1 files changed, 24 insertions, 0 deletions
diff --git a/MakeItIncreasing.cpp b/MakeItIncreasing.cpp
new file mode 100644
index 0000000..987ef04
--- /dev/null
+++ b/MakeItIncreasing.cpp
@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+ int tt;
+ cin >> tt;
+ while(tt--) {
+ int n;
+ int ans = 0;
+ cin >> n;
+ vector<int> v(n);
+ for(auto &x : v) cin >> x;
+ for(int i = n - 1; i > 0; i--) {
+ while(v[i] <= v[i-1] && v[i - 1] > 0) {
+ v[i-1] = v[i-1] / 2;
+ ans++;
+ }
+ if(v[i] == v[i-1]) {
+ ans = -1;
+ break;
+ }
+ }
+ cout << ans << endl;
+ }
+}