From 3a89fc707253f75f46fd5a4822817f1fd5156c40 Mon Sep 17 00:00:00 2001
From: Omar Magdy <omar.professional8777@gmail.com>
Date: Mon, 30 May 2022 00:18:17 +0200
Subject: Made that every problem is its own folder to make building the code a
 smooth operation with a shortcut

---
 contests/Round#788/A/A.cpp | 50 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 50 insertions(+)
 create mode 100644 contests/Round#788/A/A.cpp

(limited to 'contests/Round#788/A/A.cpp')

diff --git a/contests/Round#788/A/A.cpp b/contests/Round#788/A/A.cpp
new file mode 100644
index 0000000..ada8036
--- /dev/null
+++ b/contests/Round#788/A/A.cpp
@@ -0,0 +1,50 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+string solve(vector<int> v) {
+  int p = 0;
+  int n = 0;
+  for(int i = 0; i < v.size(); i++) {
+    if(v[i] > 0) {
+      p++;
+    }
+    else{
+      n++;
+    }
+  }
+  int loop = min(p, n);
+  int loop1 = loop;
+  for(int i = 0; i < v.size(); i++) {
+    if(v[i] > 0 && loop != 0) {
+      v[i] = -v[i];
+      loop--;
+    }
+  }
+  loop = min(p, n);
+  for(int i = v.size() - 1; i > 0; i--) {
+    if(v[i] < 0 && loop1 != 0) {
+      v[i] = -v[i];
+      loop1--;
+    }
+  }
+  if(is_sorted(v.begin(), v.end())) {
+    return "YES";
+  }
+  return "NO";
+}
+
+
+int main () {
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    int n;
+    cin >> n;
+    vector<int> v(n);
+    for(auto &x : v) {
+      cin >> x;
+    }
+    cout << solve(v) << endl;
+  }
+}
-- 
cgit v1.2.3