diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-09-09 23:03:50 +0300 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-09-09 23:03:50 +0300 |
| commit | 6cde2cdd6a4753193f83ff1cd2f635582f3949eb (patch) | |
| tree | 4f5524c4382bd232297b85be3bcbe50100485e0f | |
| parent | 7f74d8c55e6813f26dfa7c2ef1bcb3aefa8f1f63 (diff) | |
| download | competitive-programming-6cde2cdd6a4753193f83ff1cd2f635582f3949eb.tar.xz competitive-programming-6cde2cdd6a4753193f83ff1cd2f635582f3949eb.zip | |
Solved problem Particles
| -rwxr-xr-x | codeforces/Particles/main.cpp | 146 | ||||
| -rw-r--r-- | codeforces/Particles/main_input0.txt | 7 | ||||
| -rw-r--r-- | codeforces/Particles/main_output0.txt | 3 |
3 files changed, 156 insertions, 0 deletions
diff --git a/codeforces/Particles/main.cpp b/codeforces/Particles/main.cpp new file mode 100755 index 0000000..839d7ea --- /dev/null +++ b/codeforces/Particles/main.cpp @@ -0,0 +1,146 @@ +#include <algorithm> +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) \ + sort(all((x))); \ + (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b)-1) / (b) + +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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(vals...); +} + +/* 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 + */ + +void solve() { + ll n; + cin >> n; + vll v(n); + for (auto &x : v) { + cin >> x; + } + vll vv(2); + for (int i = 0; i < n; i++) { + vv[i % 2] += max(v[i], 0LL); + } + ll ans = max(vv[0], vv[1]); + if (ans == 0) { + ans = *max_element(all(v)); + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/Particles/main_input0.txt b/codeforces/Particles/main_input0.txt new file mode 100644 index 0000000..d59d21f --- /dev/null +++ b/codeforces/Particles/main_input0.txt @@ -0,0 +1,7 @@ +3 +6 +-3 1 4 -1 5 -9 +5 +998244353 998244353 998244353 998244353 998244353 +1 +-2718 diff --git a/codeforces/Particles/main_output0.txt b/codeforces/Particles/main_output0.txt new file mode 100644 index 0000000..0af868c --- /dev/null +++ b/codeforces/Particles/main_output0.txt @@ -0,0 +1,3 @@ +9 +2994733059 +-2718 |
