# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497702 | Codurr | Hacker (BOI15_hac) | C++14 | 331 ms | 25944 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define int long long //Avoid if time complexity very close to limit
#define ll long long
#define sz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define f first
#define s second
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s)) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
}
//Imp consts
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 1;
const int INF = 1e18 + 5;
const double pi = 3.14159265358979323846;
const double ep = 1e-20;
signed main() {
setIO();
int n, sum = 0;
cin >> n;
int x = (n + 1) / 2;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n; i++)
v.push_back(v[i]);
for (int i = 1; i <= 2 * n; i++)
v[i] += v[i - 1];
multiset<int> s;
vector<int> ans(n + 1);
for (int i = 1; i < n + x; i++) {
if (i + x - 1 <= 2 * n)
s.insert(v[i + x - 1] - v[i - 1]);
if (i >= x) {
ans[i % n] = *s.begin();
s.erase(s.find(v[i] - v[i - x]));
}
}
int Ans = -INF;
for (int i = 1; i <= n; i++)
Ans = max(Ans, ans[i]);
cout << Ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |