# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566345 | XEMPLI5 | Split the sequence (APIO14_sequence) | C++17 | 16 ms | 1236 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;
int main()
{
int n, k;
cin >> n >> k;
vector<int> trees(n), pref(n);
for (int i = 0; i < n; i++)
{
cin >> trees[i];
pref[i] = trees[i];
if (i)
pref[i] += pref[i - 1];
}
set<pair<int, int>> parts;
parts.insert({0, n - 1});
int ans = 0;
vector<int> moves;
for (int l = 0; l < k; l++)
{
int mxVal = 0, loc = -1, mst = -1, med = -1;
for (auto e : parts)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |