From 1ccba7112b334c0887bd349966219b38eb9ccfb9 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 10 Dec 2023 15:55:42 +0200 Subject: Removed some empty problems and solved 2 problems in rust --- contests/Round828/E/main.cpp | 79 -------------------------------------------- 1 file changed, 79 deletions(-) delete mode 100755 contests/Round828/E/main.cpp (limited to 'contests/Round828/E') diff --git a/contests/Round828/E/main.cpp b/contests/Round828/E/main.cpp deleted file mode 100755 index 68691f8..0000000 --- a/contests/Round828/E/main.cpp +++ /dev/null @@ -1,79 +0,0 @@ -#include -#include - -using namespace std; - -using ll = long long; -using pi = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define push_back pb -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -auto helper(vi &v) { - ll ans = 0, zc = 0; - for (int i = v.size() - 1; i >= 0; i--) { - (v[i] == 0 ? zc++ : ans += zc); - } - return ans; -} - -void solve() { - int n; - cin >> n; - vi v(n), v1(n), v2(n); - for (int i = 0; i < n; i++) { - cin >> v[i]; - } - v1 = v; - v2 = v; - for (auto &x : v1) { - if (x == 0) { - x = 1; - break; - } - } - for (int i = n - 1; i >= 0; i--) { - if (v2[i] == 1) { - v2[i] = 0; - break; - } - } - ll og = helper(v); - ll l = helper(v1); - ll r = helper(v2); - cout << max(og, max(r, l)) << '\n'; -} - -int main() { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while (tt--) { - solve(); - } -} - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -- cgit v1.2.3