# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877121 | auslander | Bigger segments (IZhO19_segments) | C++17 | 1 ms | 2396 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 <algorithm>
#include <iostream>
#include <vector>
#include <iterator>
using namespace std;
typedef long long ll;
const int N = 5e5;
ll arr[N], pref[N];
int main()
{
ll i, j, n, m;
cin >> n;
for (i = 0; i < n; i++)
cin >> arr[i];
vector<ll>v;
ll p = arr[0];
ll k = 0;
j = 0;
ll res = 1;
for (i = 1; i < n; i++)
{
k += arr[i];
pref[j] = k;
if (p <= k)
{
res++;
vector<ll>::iterator it = upper_bound(v.begin(), v.end(), (k - p) / 2);
if (it == v.begin())
{
p = k;
k = 0;
j = 0;
v.erase(v.begin(), v.end());
}
else
{
p = k - pref[(it - v.begin()) - 1];
k = 0;
j = 0;
v.erase(v.begin(), v.end());
}
}
else
{
v.push_back(k);
j++;
}
}
cout << res << endl;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |