Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n;
- cin >> n;
- vector<int> a(n);
- for (auto &el : a) cin >> el;
- a.push_back(0); ++n;
- long long ans = 1, pref = 1, suff = 1, all = 1;
- int cntu = 0, st = -1, en = -1;
- for (int i = 0; i < n; ++i) {
- if (a[i] == 0) {
- if (cntu % 2 == 0) {
- ans = max(ans, all);
- } else {
- ans = max(ans, max(all / pref, all / suff));
- }
- pref = suff = all = 1;
- continue;
- }
- if (a[i] < 0) {
- ++cntu;
- if (st == -1) { st = i; pref *= abs(a[i]); }
- en = i;
- suff = abs(a[i]);
- }
- all *= abs(a[i]);
- if (st == -1) pref *= a[i];
- suff *= a[i];
- }
- cout << ans << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement