# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133514 | finalventure | Split the sequence (APIO14_sequence) | C++17 | 2096 ms | 24644 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
iostream::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
vector<long long> prefixSum(n + 1, 0);
for (int i = 1; i <= n; ++i)
{
prefixSum[i] = prefixSum[i - 1] + a[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, 0));
vector<vector<int>> splits(n + 1, vector<int>(k + 1, -1));
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= min(i - 1, k); ++j)
{
dp[i][j] = LLONG_MIN;
# | 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... |