aboutsummaryrefslogtreecommitdiff
path: root/contests/Round#788/A(2_pointers)/A(2_pointers).cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /contests/Round#788/A(2_pointers)/A(2_pointers).cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'contests/Round#788/A(2_pointers)/A(2_pointers).cpp')
-rw-r--r--contests/Round#788/A(2_pointers)/A(2_pointers).cpp29
1 files changed, 29 insertions, 0 deletions
diff --git a/contests/Round#788/A(2_pointers)/A(2_pointers).cpp b/contests/Round#788/A(2_pointers)/A(2_pointers).cpp
new file mode 100644
index 0000000..5d56719
--- /dev/null
+++ b/contests/Round#788/A(2_pointers)/A(2_pointers).cpp
@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main () {
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ int n;
+ cin >> n;
+ vector<int> v(n);
+ for(auto &x : v) {
+ cin >> x;
+ }
+ int l = 0, r = v.size() - 1;
+ while(r > l) {
+ while(v[l] < 0) {
+ l++;
+ }
+ while(v[r] > 0) {
+ r--;
+ }
+ if(l > r) break;
+ v[l] = -v[l];
+ v[r] = -v[r];
+ }
+ cout << (is_sorted(v.begin(), v.end()) ? "YES" : "NO");
+ }
+}
+
+