diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
| commit | 3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch) | |
| tree | 474b08b187895af91c10838aae21142b2ba2514d /contests/Round#788/A.cpp | |
| parent | f5ff62a26052f084b6b807cba220c86785fd45e3 (diff) | |
| download | competitive-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.cpp')
| -rw-r--r-- | contests/Round#788/A.cpp | 50 |
1 files changed, 0 insertions, 50 deletions
diff --git a/contests/Round#788/A.cpp b/contests/Round#788/A.cpp deleted file mode 100644 index ada8036..0000000 --- a/contests/Round#788/A.cpp +++ /dev/null @@ -1,50 +0,0 @@ -#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; - } -} |
